Lesk Algorithm (1983) › The Ambiguity Problem

Every natural language teems with ambiguity, and polysemy.the phenomenon of single words carrying multiple distinct meanings.presents perhaps the most pervasive challenge for computational understanding. Consider the apparent simplicity of this sentence: "The bank can guarantee deposits will eventually cover all losses." To a human reader, the interpretation feels immediate and obvious, but that immediacy conceals a remarkable cognitive achievement. The word "bank" alone has more than a dozen distinct senses in most dictionaries, ranging from financial institutions to riverbanks, from turning aircraft to pool shots in billiards. Without conscious effort, readers select the appropriate meaning using contextual cues scattered throughout the sentence."guarantee," "deposits," "losses".words that collectively evoke the financial domain.

Computational systems of the early 1980s had no principled mechanism for performing this disambiguation. Rule-based approaches attempted to encode explicit disambiguation rules: if "bank" appears near "money," select the financial sense; if it appears near "river" or "stream," select the geographical sense. These hand-crafted rules proved brittle and labor-intensive, requiring linguists to anticipate every possible context for every ambiguous word. The approach didn't scale. English alone contains hundreds of thousands of polysemous words, and attempting to write exhaustive rules for each would require decades of expert effort. Context could also operate subtly: relevant clues might appear sentences away from the ambiguous word or emerge from the interaction of multiple contextual elements rather than any single "trigger word."

The problem became acute as researchers attempted to build practical systems. Machine translation systems mistranslated sentences because they selected wrong word senses. Information retrieval systems returned irrelevant documents because they couldn't distinguish between different meanings of search terms. Text-to-speech systems chose incorrect pronunciations for heteronyms.words spelled identically but pronounced differently depending on meaning, like "lead" (to guide) versus "lead" (the metal). Question-answering systems extracted nonsensical answers because they misunderstood ambiguous words in questions or documents. Each application exposed the same fundamental gap: without resolving lexical ambiguity, deeper language understanding remained elusive.

Previous attempts at automated disambiguation had focused primarily on syntactic or selectional restriction approaches. These methods used grammatical patterns and semantic constraints to filter impossible readings.for instance, knowing that verbs like "eat" require animate subjects and edible objects. While useful for certain types of ambiguity, these approaches failed for polysemy cases where multiple senses satisfied syntactic and basic semantic constraints. The sentence "The bank issued new bonds" works grammatically whether "bank" means riverbank or financial institution, even though only one makes semantic sense. What was needed wasn't a filter for impossible readings, but a positive method for selecting the most plausible sense given the full contextual evidence.