Content deleted Content added
Citation bot (talk | contribs) m Alter: isbn, template type. Add: citeseerx. Removed parameters. You can use this bot yourself. Report bugs here. | User-activated. |
adding links to references using Google Scholar |
||
Line 28:
2004. Evaluating Variants of the Lesk Approach for Disambiguating Words. LREC, Portugal.</ref> has shown that the simplified Lesk algorithm can significantly outperform the original definition of the algorithm, both in terms of precision and efficiency. By evaluating the disambiguation algorithms on the Senseval-2 English all words data, they measure a 58% precision using the simplified Lesk algorithm compared to the only 42% under the original algorithm.
Note: Vasilescu 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. [https://books.google.com/books?id=GLck75U20pAC&printsec=frontcover#v=onepage&q=Lesk&f=false Word Sense Disambiguation: Algorithms and Applications]. Dordrecht: Springer. www.wsdbook.org</ref>
'''Simplified LESK Algorithm with smart default word sense (Vasilescu et al., 2004)'''<ref>Florentina Vasilescu, Philippe Langlais, and Guy Lapalme.
| |||