Sentence co-occurrences as small-world graphs: a solution to automatic lexical disambiguation

Authors:
Stefan Bordag
Affiliations:
Universität Leipzig, Institut für Informatik, Leipzig
Venue:
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Year:
2003

Citing 2
Cited 2

Foundations of statistical natural language processing

Foundations of statistical natural language processing
An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet

CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing

Graph theoretic modeling of large-scale semantic networks

Journal of Biomedical Informatics
Automatic discovery of word semantic relations using paraphrase alignment and distributional lexical semantics analysis

Natural Language Engineering

Quantified Score

Hi-index	0.00

Visualization

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.