In Simplified Lesk algorithm, the correct meaning of each word in a textgiven contest is determined individually by findinglocating the sense that leads tooverlaps the highest overlapmost between its dictionary definition and the currentgiven context. Rather than seeking to simultaneously determinedetermining the meaningmeanings of all words in a given textcontext, this approach tackles each word individually, regardlessindependent of the meaning of the other words occuring in the same context.
"A comparative evaluation perfomed by 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> 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 owrdswords, data, they measure a 58% precision using the simplified Lesk algorithm compared to the only 42% under the original algorithm.
Note: thatVasileseu theiret 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>
<b>Simplified Lesk Algorithm (Kilgarriff and Rosenzweig, 2000)</b><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>
