Lesk algorithm: Difference between revisions

Revision as of 04:46, 7 July 2021

Revision as of 12:27, 22 November 2021

Line 42:

::''overlap'' <- COMPUTEOVERLAP (''signature,context'')

::'''if''' ''overlap > max-overlap'' ''' then'''

::::''max-overlap <- overlap''

::::''best-sense <- sense''

''' end '''

''' return '''(''best-sense'')

Line 55:

A lot of work has appeared offering different modifications of this algorithm. These works use other resources for analysis (thesauruses, synonyms dictionaries or morphological and syntactic models): for instance, it may use such information as synonyms, different derivatives, or words from definitions of words from definitions.<ref>Alexander Gelbukh, Grigori Sidorov. [https://www.gelbukh.com/CV/Publications/2004/NTI-2004-senses.htm Automatic resolution of ambiguity of word senses in dictionary definitions] (in Russian). J. Nauchno-Tehnicheskaya Informaciya (NTI), ISSN 0548-0027, ser. 2, N 3, 2004, pp. 10–15.</ref>

There are a lot of studies concerning Lesk and its extensions:<ref>Roberto Navigli. [http://www.dsi.uniroma1.it/~navigli/pubs/ACM_Survey_2009_Navigli.pdf ''Word Sense Disambiguation: A Survey]''], ACM Computing Surveys, 41(2), 2009, pp. 1–69.</ref>

* Wilks and Stevenson, 1998, 1999;