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.
2016
2016
Le and Fokkens (2015) recently showed that taxonomy-based approaches are more reliable than corpus-based approaches in estimating… 
2012
2012
This paper investigates the effects of stemming, stop word removal and size of context window on Hindi word sense disambiguation… 
2009
2009
| @ | gmail.com, www.gelbukh.com Abstract. There are many similarity measures to determine the similarity relatedness between two… 
2008
2008
This paper reconsiders the task of MRDbased word sense disambiguation, in extending the basic Lesk algorithm to investigate the… 
2008
2008
The paper is concerned with the realization of subjects in Russian (Ru) as compared with Polish (Po) and Czech (Cz). Non-overt… 
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…