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.
2014
2014
This dissertation constructs an analytical history of gay theatre in Toronto from 1967 to 1985, a period that saw the radical… 
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… 
Review
2004
Review
2004
Preface.List of Contributors.1. Annotation and Databases: Status and Prospects (M. Hoebeke, H. Chiapello, J.-F. Gibrat, Ph… 
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… 
1993
1993
Computer-Aided Software Engineering (CASE) tools encourage users to codify the speciication for the design of a system early in… 
Review
1993
Review
1993
Although automated word sense disambiguation has become a popular activity within computational lexicology, evaluation of the…