In this paper we present an unsupervised ap- proach to word sense disambiguation based on evolutionary game theory. In our algorithm each word to be disambiguated is represented as a node on a graph and each sense as a class. The algorithm performs a consistent class as- signment of senses according to the similarity information of each word with the others, so that similar words are constrained to similar classes. The dynamics of the system are for- mulated in terms of a non-cooperative multi- player game, where the players are the data points to decide their class memberships and equilibria correspond to consistent labeling of the data.
WSD-games: a game-theoretic algorithm for unsupervised word sense disambiguation
TRIPODI, ROCCO;PELILLO, Marcello
2015-01-01
Abstract
In this paper we present an unsupervised ap- proach to word sense disambiguation based on evolutionary game theory. In our algorithm each word to be disambiguated is represented as a node on a graph and each sense as a class. The algorithm performs a consistent class as- signment of senses according to the similarity information of each word with the others, so that similar words are constrained to similar classes. The dynamics of the system are for- mulated in terms of a non-cooperative multi- player game, where the players are the data points to decide their class memberships and equilibria correspond to consistent labeling of the data.
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
