Abstract
This paper presents a graph-theoretical approach to lexical disambiguation on word co-occurrences. Producing a dictionary similar to WordNet, this method is the counterpart to word sense disambiguation and thus makes one more step towards completely unsupervised natural language processing algorithms as well as generally better understanding of how to make computers meaningfully process natural language data. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Bordag, S. (2003). Sentence co-occurrences as small-world graphs: A solution to automatic lexical disambiguation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2588, 329–332. https://doi.org/10.1007/3-540-36456-0_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
