Lesk algorithm: Difference between revisions

Revision as of 16:08, 28 September 2007

Revision as of 16:55, 29 September 2007

Line 7:

The Lesk algorithm is based on the assumption that words in a given neighbourhood will tend to share a common topic. A naive implementation of the The Lesk algorithm would be

# choosing pairs of ambiguous words within a neighbourhood

# checks their definitions in a dictionnarydictionary

# choose the senses as to maximise the number of common terms in the definitions of the chosen words.

Accuracy on ''[[Pride and Prejudice]]'' and selected papers of the [[Associated Press]] was found to be in the 50% to 70% range.

A simplified version of the Lesk algorithm is to compare the dictionnarydictionary definition of an ambiguous word with the terms contained of the neighbourhood.

Versions have been adapted to [[Wordnet]]<ref>

Line 24:

[[Category:Semantics]]

[[Category:Computational linguistics]]

{{ling-stub}}