Sciweavers

Share
CICLING
2003
Springer

Sentence Co-occurrences as Small-world Graphs: A Solution to Automatic Lexical Disambiguation

9 years 8 months ago
Sentence Co-occurrences as Small-world Graphs: A Solution to Automatic Lexical Disambiguation
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.
Stefan Bordag
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where CICLING
Authors Stefan Bordag
Comments (0)
books