Content deleted Content added
m ISBNs (Build KC) |
reference did not match pseudocode. Pseudocode referred to 2004 paper, not the 2000 original simplified LESK paper given that no TF-IDF scores were used and a default word sense was introduced for 0 overlap which is only mentioned in the 2004 paper. |
||
Line 23:
==Simplified Lesk algorithm==
In Simplified Lesk algorithm<ref>Kilgarriff and J. Rosenzweig. 2000. English SENSEVAL:Report and Results. In Proceedings of the 2nd International Conference on Language Resourcesand Evaluation, LREC, Athens, Greece.</ref>, the correct meaning of each word in a given context is determined individually by locating the sense that overlaps the most between its dictionary definition and the given context. Rather than simultaneously determining the meanings of all words in a given context, this approach tackles each word individually, independent of the meaning of the other words occurring in the same context.
"A comparative evaluation performed by Vasileseu et al. (2004)<ref>Florentina Vasilescu, Philippe Langlais, and Guy Lapalme.
Line 30:
Note: Vasileseu et al. implementation considers a back-off strategy for words not covered by the algorithm, consisting of the most frequent sense defined in WordNet. This means that words for which all their possible meanings lead to zero overlap with current context or with other word definitions are by default assigned sense number one in WordNet."<ref>Agirre, Eneko & Philip Edmonds (eds.). 2006. Word Sense Disambiguation: Algorithms and Applications. Dordrecht: Springer. www.wsdbook.org</ref>
'''Simplified LESK Algorithm with smart default word sense (Vasileseu et al., 2004)'''<ref>Florentina Vasilescu, Philippe Langlais, and Guy Lapalme.
2004. Evaluating Variants of the Lesk Approach for Disambiguating Words. LREC, Portugal.</ref>
{| class="wikitable"
|-
| |||