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.

• Type: Conference
• Year: 2003
• Where: CICLING
• Authors: Stefan Bordag
• Keywords: CICLING 2003, Lexical Disambiguation, Natural Language, Natural Language Processing, Word Sense Disambiguation