The resolution of lexical ambiguity is important for most natural language processing tasks, and a range of computational techniques have been proposed for its solution. None of these has yet proven effective on a large scale. In this paper, we describe a method for lexical disambiguation of text using the definitions in a machine-readable dictionary together with the technique of simulated annealing. The method operates on complete sentences and attempts to select the optimal combinations of word senses for all the words in the sentence simultaneously. The words in the sentences may be any of the 28,000 headwords in Longman's Dictionary of Contemporary English (LDOCE) and are disambiguated relative to the senses given in LDOCE. Our initial results on a sample set of 50 sentences are comparable to those of other researchers, and the fully automatic method requires no hand coding of lexical entries, or hand tagging of text.
[1]
Yorick Wilks,et al.
Subject-Dependent Co-Occurence and Word Sense Disambiguation
,
1991,
ACL.
[2]
Paul S. Jacobs,et al.
Tagging for Learning: Collecting Thematic Relations from Corpus
,
1990,
COLING.
[3]
Paul Procter,et al.
Longman Dictionary of Contemporary English
,
1978
.
[4]
Yorick Wilks,et al.
An intelligent analyzer and understander of English
,
1975,
Commun. ACM.
[5]
Geoffrey Sampson,et al.
A Stochastic Approach to Parsing
,
1986,
COLING.
[6]
Michael E. Lesk,et al.
Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone
,
1986,
SIGDOC '86.
[7]
Yorick Wilks,et al.
A Preferential, Pattern-Seeking, Semantics for Natural Language Inference
,
1975,
Artif. Intell..