Lesk Algorithm (1983) › Extensions and Descendants

The research community quickly recognized both the promise and limitations of Lesk's approach, spawning decades of refinements and extensions. Many of these variants attempted to address the sparse overlap problem by expanding the comparison space. The "Extended Lesk" algorithm, proposed by Banerjee and Pedersen in 2002, incorporated the target word's definitions along with the definitions of words related to each sense in a semantic network like WordNet. If one sense of "bank" was linked to "money" through semantic relations, the definition of "money" would be included in the comparison, effectively enriching the definitional footprint of each sense.

Other researchers adapted the algorithm to use corpus statistics. Instead of simple overlap counts, these variants weighted matching words by their inverse document frequency (IDF). This emphasized rare, semantically distinctive words over common ones. The word "institution" matching in both definition and context might receive higher weight than "the" or "of." Some approaches went further, using the entire corpus to build word association scores, then computing exact matches and semantic similarity between definition words and context words based on their corpus-derived associations. These hybrid methods began to blur the line between Lesk's knowledge-based approach and emerging statistical methods.

Another important extension addressed the context limitation by incorporating selectional preferences and syntactic information. These variants analyzed the syntactic role of the ambiguous word.was it a subject, object, or modifier?.and weighted overlaps from syntactically related words more heavily than distant words. For disambiguating a verb, the definitions of its subject and object would contribute more than random nearby words. This syntactically informed approach improved precision, especially for verb disambiguation, though it required adding a syntactic parser to the processing pipeline.

Perhaps the most significant descendant of Lesk's approach emerged with the development of embedding-based methods in the 2010s. These modern approaches replace exact word matching with semantic similarity computed in vector space. Rather than checking if "car" equals "vehicle," they compute the cosine similarity between embedding vectors for "car" and "vehicle," capturing semantic relatedness. The core Lesk intuition remains.comparing the semantic content of context against the semantic content of sense definitions.but the comparison operates in continuous vector space rather than discrete word space. Techniques like BERT-based word sense disambiguation essentially perform a learned, contextualized variant of the Lesk algorithm, using transformer representations to measure how well a context fits each candidate sense.