Lesk Algorithm (1983) › Limitations and Challenges

For all its elegance, the Lesk algorithm suffered from significant limitations that prevented it from achieving human-level disambiguation accuracy. The most fundamental problem was sparse overlap: in many cases, the words in the context and the words in the correct sense definition simply didn't match, even when the sense was clearly correct to human readers. Dictionary definitions are necessarily concise, typically containing twenty to fifty words for common senses. The context window around an ambiguous word, while larger, might not contain any of these specific definitional words even when the overall semantic domain matched. A text discussing banking might use "financial," "transaction," "lending," and "credit" in the surrounding context, but the dictionary definition of "bank" might instead use "institution," "money," "safeguard," and "currency".semantically related concepts described with different vocabulary.

This lexical gap problem was exacerbated by the rigid surface-form matching the algorithm employed. Synonyms provided no benefit: if the definition said "vehicle" and the context said "car," no overlap registered. Morphological variants similarly failed to match: "fishing" in the context didn't match "fish" in the definition unless special preprocessing handled morphology. Deeper semantic relationships like hypernymy (cat/animal) or meronymy (wheel/car) went entirely unrecognized. The algorithm operated in a world of exact string equality, blind to the rich semantic structure of language.

Short contexts proved particularly problematic. Telegraphic text.headlines, queries, social media posts, technical lists.often lacked sufficient context words for reliable overlap computation. A two-word Google search query like "java performance" might contain too little context to reliably disambiguate "java," especially if the dictionary definitions themselves were brief. The algorithm would either produce ties (multiple senses with zero overlap) or unstable results (disambiguation based on a single coincidental word match).

The algorithm also struggled with senses whose definitions overlapped heavily. Many polysemous words have related senses."bank" as a building and "bank" as an institution, "chicken" as an animal and "chicken" as meat. These sense distinctions, while meaningful to humans, often involve definitions that share significant vocabulary. The financial institution sense might mention "building," "customers," and "services," while the physical building sense mentions "structure," "customers," and "services." The definitional overlap makes discrimination difficult, leading to systematic confusion between closely related senses.

Perhaps more subtly, the algorithm had no mechanism for handling pragmatic or figurative language. Metaphorical uses of words."He's a real bank of information".would be disambiguated based on surrounding literal vocabulary, often yielding nonsensical sense assignments. Idioms posed similar challenges: in "break the bank," the phrase means something distinct from either literal sense of "bank," but the algorithm had no way to recognize this. It operated under the assumption that every word usage corresponded to one of its dictionary senses, an assumption that natural language regularly violates.