Lesk algorithm: Difference between revisions

Revision as of 21:12, 18 May 2008

Revision as of 17:09, 5 March 2009

Line 1:

The '''Lesk algorithm''' is a classical algorithm for [[word sense disambiguation]] introduced by [[Mike Lesk|Michael E. Lesk]] in 1986.

{{Wikify|date=September 2007}}

The '''Lesk algorithm''' is a classical algorithm for [[word sense disambiguation]] introduced by [[Mike Lesk|Michael E. Lesk]] in 1986

<ref>

''[http://portal.acm.org/ft_gateway.cfm?id=318728&type=pdf&dl=GUIDE&dl=ACM Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone]'', [[Mike Lesk|Michael Lesk]], ACM Special Interest Group for Design of Communication Proceedings of the 5th annual international conference on Systems documentation, p. 24 - 26, 1986. ISBN 0897912241 [http://portal.acm.org/citation.cfm?id=318728]

</ref>.

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

Line 14 ⟶ 13:

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

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

''[http://www.cs.cmu.edu/~banerjee/Publications/cicling2002.ps.gz An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet]'', [[Satanjeev Banerjee]] and [[Ted Pedersen]], Lecture Notes In Computer Science; Vol. 2276, Pages: 136 - 145, 2002. ISBN 3540432191

</ref>.

== References ==