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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Ion, R., & Ştefǎnescu, D. (2011). Unsupervised word sense disambiguation with lexical chains and graph-based context formalization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6562 LNAI, pp. 435–443). https://doi.org/10.1007/978-3-642-20095-3_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
