Lesk algorithm: Difference between revisions

Revision as of 12:04, 2 September 2023

Latest revision as of 17:12, 26 November 2024

(3 intermediate revisions by 3 users not shown)

Line 1:

{{Short description|Natural language processing algorithm}}

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

Lesk, M. (1986). [http://portal.acm.org/citation.cfm?id=318728&dl=GUIDE,ACM&coll=GUIDE&CFID=103485667&CFTOKEN=64768709 Automatic sense disambiguation using machine readable dictionaries: how to tell a pine cone from an ice cream cone]. In SIGDOC '86: Proceedings of the 5th annual international conference on Systems documentation, pages 24-26, New York, NY, USA. ACM.

</ref> It operates on the premise that words within a given context are likely to share a common meaning. This algorithm compares the dictionary definitions of an ambiguous word with the words in its surrounding context to determine the most appropriate sense. Variations, such as the Simplified Lesk algorithm, have demonstrated improved precision and efficiency. However, the Lesk algorithm has faced criticism for its sensitivity to definition wording and its reliance on brief glosses. Researchers have sought to enhance its accuracy by incorporating additional resources like thesauruses and syntactic models.

Line 71 ⟶ 72:

==See also==

{{Commons}}

{{Portal|Linguistics}}

* [[Word-sense disambiguation]]