Lesk algorithm: Difference between revisions

Revision as of 08:03, 18 May 2011

Revision as of 12:57, 5 July 2011

Line 10:

# the sense that is to be chosen is the sense which has the biggest number of this count

QuiteA commonfrequently used '''example''' of working ofillustrating this algorithm is for the context "PINEpine CONEcone". The following dictionary definitions are used:

PINE

1. kinds of evergreen tree with needle-shaped leaves

Line 19:

2. something of this shape whether solid or hollow

3. fruit of certain evergreen trees

As you can seebe seen, the best intersection is Pine#1 ⋂ Cone#3 = 2.

==Simplified Lesk algorithm==