Content deleted Content added
→Criticisms and other Lesk-based methods: Sorting the articles by date |
m link Cosine similarity using Find link |
||
Line 69:
==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|last=Banerjee|first=Satanjeev|last2=Pedersen|first2=Ted|date=2002-02-17|title=An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet|journal=Computational Linguistics and Intelligent Text Processing|series=Lecture Notes in Computer Science|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==
| |||