Skip to search formSkip to main contentSkip to account menu

Lesk algorithm

Known as: Lesk 
The Lesk algorithm is a classical algorithm for word sense disambiguation introduced by Michael E. Lesk in 1986.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
In recent years, several semantic similarity and relatedness measures have been developed and applied in many domains including… 
2010
2010
Many publishers follow the Library of Congress Classification (LCC) scheme to indicate a classification code on the first pages… 
2009
2009
| @ | gmail.com, www.gelbukh.com Abstract. There are many similarity measures to determine the similarity relatedness between two… 
2004
2004
Word sense disambiguation is the process of automatically clarifying the meaning of a word in its context. It has drawn much… 
2004
2004
The recognition of conversational speech is a hard problem. Semantic relatedness measures can improve speech recognition… 
Highly Cited
2003
Highly Cited
2003
This paper motivates and presents the Topic-based Vector Space Model (TVSM), a new vector-based approach for document comparison… 
2002
2002
This paper proposes a method by which 5W1H (who, when, where, what, why, how, and predicate) information is used to classify and… 
1996
1996
Trends in the development of computer hardware are making the use of distributed systems increasingly attractive. The collection…