Lesk algorithm: Difference between revisions

Revision as of 15:59, 2 May 2023

Revision as of 11:41, 23 August 2023

Line 68:

==Lesk variants==

* Original Lesk (Lesk, 1986)

* Adapted/Extended Lesk (Banerjee and Pederson, 2002/2003): In the adaptive lesk algorithm, a word vector is created corresponds to every content word in the wordnet gloss. Concatenating glosses of related concepts in WordNet can be used to augment this vector. The vector contains the co-occurrence counts of words co-occurring with w in a large corpus. Adding all the word vectors for all the content words in its gloss creates the Gloss vector g for a concept. Relatedness is determined by comparing the gloss vector using the [[Cosine similarity]] measure.<ref>{{Cite book|last1=Banerjee|first1=Satanjeev|last2=Pedersen|first2=Ted|datetitle=2002-02-17Computational Linguistics and Intelligent Text Processing |titlechapter=An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet |journaldate=Computational Linguistics and Intelligent Text Processing2002-02-17|series=Lecture Notes in Computer Science|volume=2276 |language=en|publisher=Springer, Berlin, Heidelberg|pages=136–145|doi=10.1007/3-540-45715-1_11|isbn=978-3540457152|citeseerx=10.1.1.118.8359}}</ref>

==See also==