Abstract
This paper presents an unsupervised word sense disambiguation (WSD) algorithm that makes use of lexical chains concept [6] to quantify the degree of semantic relatedness between two words. Essentially, the WSD algorithm will try to maximize this semantic measure over a graph of content words in a given sentence in order to perform the disambiguation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agirre, E., de Lacalle, O.L., Fellbaum, C., Hsieh, S.K., Tesconi, M., Monachini, M., Vossen, P., Segers, R.: SemEval-2010 Task 17: All-wordsWord Sense Disambiguation on a Specific Domain. In: Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010, Uppsala, Sweden, July 15-16, pp. 75–80. Association for Computational Linguistics (2010)
Fellbaum, C. (ed.): WordNet: an Electronic Lexical Database. MIT Press, Cambridge (1998)
Galley, M., McKeown, K.: Improving word sense disambiguation in lexical chaining. In: Proceedings of 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico, August 9-15 (2003)
Ion, R., Tufiş, D.: RACAI: Meaning Affinity Models. In: Agirre, E., Màrquez, L., Wicentowski, R. (eds.) Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval 2007), Prague, Czech Republic, pp. 282–287. Association for Computational Linguistics (June 2007)
Miller, G.A., Leacock, C., Tengi, R., Bunker, R.T.: A semantic concordance. In: Proceedings of the 3rd DARPA Workshop on Human Language Technology, Plainsboro, New Jersey, pp. 303–308 (1993)
Moldovan, D., Novischi, A.: Lexical chains for question answering. In: Proceedings of the 19th International Conference on Computational Linguistics, Taipei, Taiwan, August 24-September 01, pp. 1–7 (2002)
Navigli, R., Lapata, M.: An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI) 32(4), 678–692 (2010)
Pradhan, S.S., Loper, E., Dligach, D., Palmer, M.: SemEval-2007 Task 17: English Lexical Sample, SRL and All Words. In: Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval 2007), Prague, pp. 87–92. Association for Computational Linguistics (June 2007)
Silber, H.G., McCoy, K.F.: Efficiently computed lexical chains as an intermediate representation for automatic text summarization. Computational Linguistics 28(4), 487–496 (2002)
Sinha, R., Mihalcea, R.: Unsupervised Graph-based Word Sense Disambiguation Using Measures of Word Semantic Similarity. In: Proceedings of the IEEE International Conference on Semantic Computing (ICSC 2007), Irvine, CA (September 2007)
Tufiş, D., Ion, R., Ceauşu, A., Ştefănescu, D.: RACAI’s Linguistic Web Services. In: Proceedings of the 6th Language Resources and Evaluation Conference – LREC 2008, Marrakech, Morocco, ELRA – European Language Resources Association (May 2008) ISBN 2-9517408-4-0
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ion, R., Ştefănescu, D. (2011). Unsupervised Word Sense Disambiguation with Lexical Chains and Graph-Based Context Formalization. In: Vetulani, Z. (eds) Human Language Technology. Challenges for Computer Science and Linguistics. LTC 2009. Lecture Notes in Computer Science(), vol 6562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20095-3_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-20095-3_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20094-6
Online ISBN: 978-3-642-20095-3
eBook Packages: Computer ScienceComputer Science (R0)