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.
2012
2012
paper we are proposing a text clustering method based on a well-known Word Sense Disambiguation (WSD) algorithm, the Lesk… 
2010
2010
Automatic extraction of hypernym-hyponym pairs has been done in many researches. But none is described as an automatic method to… 
2009
2009
| @ | gmail.com, www.gelbukh.com Abstract. There are many similarity measures to determine the similarity relatedness between two… 
2009
2009
PEnTrans is an automatic bidirectional English/ Persian text translator. It contains two main modules, PEnT1,2. PEnT1 translates… 
2004
2004
The recognition of conversational speech is a hard problem. Semantic relatedness measures can improve speech recognition… 
2002
2002
This paper proposes a method by which 5W1H (who, when, where, what, why, how, and predicate) information is used to classify and… 
Review
1993
Review
1993
Although automated word sense disambiguation has become a popular activity within computational lexicology, evaluation of the… 
1993
1993
Computer-Aided Software Engineering (CASE) tools encourage users to codify the speciication for the design of a system early in…