Content deleted Content added
m →Overview: HTTP → HTTPS for Carnegie Mellon CS, replaced: http://www.cs.cmu.edu/ → https://www.cs.cmu.edu/ |
→Lesk Variants: MOS:HEAD |
||
Line 67:
* Gelbukh and Sidorov, 2004.
==Lesk
* Original Lesk (Lesk, 1986)
* Adapted/Extended Lesk (Banerjee and Pederson, 2002/2003) : In 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>
| |||