Lesk algorithm: Difference between revisions

Revision as of 17:51, 7 March 2013

Revision as of 20:59, 14 March 2013

Line 5:

==Overview==

The Lesk algorithm is based on the assumption that words in a given "neighborhood" (section of text) will tend to share a common topic. A simplified version of the Lesk algorithm is to compare the dictionary definition of an ambiguous word with the terms contained ofin theits neighborhood. Versions have been adapted to use [[WordNet]].<ref>Satanjeev Banerjee and Ted Pedersen. ''[http://www.cs.cmu.edu/~banerjee/Publications/cicling2002.ps.gz An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet]'', Lecture Notes In Computer Science; Vol. 2276, Pages: 136 - 145, 2002. ISBN 3-540-43219-1

</ref> ItAn wouldimplementation bemight look like this:

# for every sense of the word being disambiguated one should count the amount of words that are in both neighborhood of that word and in the definition of each sense in a dictionary

# the sense that is to be chosen is the sense which has the biggest number of this count

Line 19:

2. something of this shape whether solid or hollow

3. fruit of certain evergreen trees

As can be seen, the best intersection is Pine #1 ⋂ Cone #3 = 2.

==Simplified Lesk algorithm==