Content deleted Content added
m General fixes and Typo fixing, typos fixed: occuring → occurring, orignial → original using AWB (7069) |
m sp, caps |
||
Line 21:
As you can see the best intersection is Pine#1 ⋂ Cone#3 = 2.
==Simplified Lesk
In Simplified Lesk algorithm, the correct meaning of each word in a given contest 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
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.
| |||