A Game-Theoretic Approach to Word Sense Disambiguation
Rocco Tripodi, Marcello Pelillo

TL;DR
This paper introduces a novel word sense disambiguation model based on evolutionary game theory, leveraging graph-based word relations and semantic similarity to improve disambiguation accuracy and textual coherence.
Contribution
It formulates word sense disambiguation as a game-theoretic constraint satisfaction problem, outperforming existing algorithms and adaptable to various tasks.
Findings
Outperforms state-of-the-art algorithms in disambiguation accuracy
Uses distributional and semantic similarity measures effectively
Applicable to different NLP scenarios
Abstract
This paper presents a new model for word sense disambiguation formulated in terms of evolutionary game theory, where each word to be disambiguated is represented as a node on a graph whose edges represent word relations and senses are represented as classes. The words simultaneously update their class membership preferences according to the senses that neighboring words are likely to choose. We use distributional information to weigh the influence that each word has on the decisions of the others and semantic similarity information to measure the strength of compatibility among the choices. With this information we can formulate the word sense disambiguation problem as a constraint satisfaction problem and solve it using tools derived from game theory, maintaining the textual coherence. The model is based on two ideas: similar words should be assigned to similar classes and the meaning…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
