Unsupervised Large-Vocabulary Word Sense Disambiguation with Graph-based Algorithms for Sequence Data Labeling
Summary
Most NLP labeling methods assign a tag to each word in isolation and ignore how the labels of neighbouring words constrain one another. Mihalcea proposes a sequence labeling method that builds a graph whose vertices are all candidate labels for the words in a sequence. Weighted edges encode dependencies between labels of words that lie within a set distance (MaxDist). A weighted PageRank random walk is run over this graph until scores converge, and each word then receives its highest-scoring label. All words are therefore annotated jointly, using global evidence from the whole graph.
The method is tested on unsupervised all-words word sense disambiguation, where edge weights come only from overlaps between dictionary sense definitions. On standard sense-annotated data (SENSEVAL-2, SemCor), joint labeling reduces errors by a statistically significant 10.7% compared with labeling each word separately. It also outperforms earlier unsupervised WSD systems. This shows that modelling label dependencies pays off even when the only resource is a plain dictionary, with no structured semantic network and no annotated corpus.
Key points
- Algorithm: label graph plus weighted PageRank with damping factor d = 0.85. Because every candidate sense receives a score, the method yields a ranking over senses and can return more than one sense per word.
- Main results:
- Overall accuracy is 54.2%.
- This beats Mihalcea et al. (2004) at 50.9%, McCarthy et al. (2004) at 53.0% precision, and Litkowski (2001) at 45.1%, all measured on SENSEVAL-2.
- The individual-labeling Lesk variant used as a comparison reaches 48.7% precision on SENSEVAL-2.
- SemCor (10 random documents): sequence labeling scores 56.5%, individual labeling 47.4%, and a random baseline 35.3%.
- SemCor nouns: the method reaches 64.2%, versus 62.09% for the lexical-chain approach of Galley and McKeown (2003). The author notes the comparison is not exact because tie-breaking differs: random choice here, WordNet sense order in their work.
- Robustness: results hold across fine- and coarse-grained sense distinctions and across different context window sizes.
Topics Word sense disambiguation
Institutions
Cite
Cite as Rada Mihalcea. 2005. Unsupervised Large-Vocabulary Word Sense Disambiguation with Graph-based Algorithms for Sequence Data Labeling. Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing.
@inproceedings{mihalcea2005unsupervised,
title = {{Unsupervised Large-Vocabulary Word Sense Disambiguation with Graph-based Algorithms for Sequence Data Labeling}},
author = {Rada Mihalcea},
booktitle = {Proceedings of Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing},
year = {2005},
doi = {10.3115/1220575.1220627},
url = {https://doi.org/10.3115/1220575.1220627}
}References
- S. Brin and L. Page. 1998. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1–7). our card
- A. Budanitsky and G. Hirst. 2001. Semantic distance in wordnet: An experimental, application-oriented evaluation of five measures. In Proceedings of the NAACL Workshop on WordNet and Other Lexical Resources, Pittsburgh. find
- J. Cowie, L. Guthrie, and J. Guthrie. 1992. Lexical disambiguation using simulated annealing. In Proceedings of the 5th International Conference on Computational Linguistics (COLING 1992). find
- D. Cutting, J. Kupiec, J. Pedersen, and P. Sibun. 1992. A practical part-of-speech tagger. In Proceedings of the Third Conference on Applied Natural Language Processing ANLP-92. our card
- M. Galley and K. McKeown. 2003. Improving word sense disambiguation in lexical chaining. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico, August. find
- G. Grimmett and D. Stirzaker. 1989. Probability and Random Processes. Oxford University Press. find
- M.E. Lesk. 1986. Automatic sense disambiguation using machine readable dictionaries: How to tell a pine cone from an ice cream cone. In Proceedings of the SIGDOC Conference 1986, Toronto. find
- K. Litkowski. 2001. Use of machine readable dictionaries in word sense disambiguation for Senseval-2. In Proceedings of ACL/SIGLEX Senseval-2, Toulouse, France. find
- D. McCarthy, R. Koeling, J. Weeds, and J. Carroll. 2004. Using automatically acquired predominant senses for word sense disambiguation. In Proceedings of ACL/SIGLEX Senseval-3, Barcelona, Spain. find
- R. Mihalcea, P. Tarau, and E. Figa. 2004. PageRank on semantic networks, with application to word sense disambiguation. In Proceedings of the 20st International Conference on Computational Linguistics (COLING 2004). our card
- G. Miller, C. Leacock, T. Randee, and R. Bunker. 1993. A semantic concordance. In Proceedings of the 3rd DARPA Workshop on Human Language Technology, Plainsboro, New Jersey. our card
- G. Miller. 1995. Wordnet: A lexical database. Communication of the ACM, 38(11):39–41. find
- J. Morris and G. Hirst. 1991. Lexical cohesion, the thesaurus, and the structure of text. Computational Linguistics, 17(1):21–48. find
- M. Palmer, C. Fellbaum, S. Cotton, L. Delfs, and H.T. Dang. 2001. English tasks: all-words and verb lexical sample. In Proceedings of ACL/SIGLEX Senseval-2, Toulouse, France. find
- B. Snyder and M. Palmer. 2004. The English all-words task. In Proceedings of ACL/SIGLEX Senseval-3, Barcelona, Spain. find
- F. Vasilescu, P. Langlais, and G. Lapalme. 2004. Evaluating variants of the Lesk approach for disambiguating words. In Proceedings of the Conference of Language Resources and Evaluations (LREC 2004). find
This page in Markdown → https://md.research.elamur.ai/free/en/papers/mihalcea-2005-unsupervised-large-vocabulary-word-sense/