Lesk Algorithm (1983) › 1983: The Lesk Algorithm

In the early 1980s, natural language processing stood at a curious juncture. Researchers had successfully built systems that could parse sentences, extract syntactic structures, and even perform rudimentary semantic analysis. Yet these systems stumbled over a basic gap in computational language understanding: words with multiple meanings. When a machine encountered the word "bank" in a sentence, how could it determine whether the text referred to a financial institution or the edge of a river? When "interest" appeared, was it curiosity or a percentage rate? This was a practical barrier to computers interpreting human language.

Michael Lesk, working at Bell Laboratories in Murray Hill, New Jersey, recognized that while humans resolved these ambiguities effortlessly through context, computers lacked any systematic method for doing so. The field had dictionaries.machine-readable versions were beginning to emerge.but possessing definitions wasn't the same as knowing which definition applied. Lesk understood that the solution lay not in complex linguistic rules or hand-crafted disambiguation logic, but in a deceptively elegant idea: the words surrounding an ambiguous term would themselves provide clues, and those clues could be found by comparing context against dictionary definitions.

The algorithm Lesk proposed in his 1986 paper (though developed around 1983) would become one of the most influential approaches to word sense disambiguation, a problem that remains central to language AI four decades later. Researchers could implement its simple procedure in an afternoon, and variants of the algorithm are still used in modern systems. More importantly, the Lesk algorithm changed the working style of computational linguistics: rather than trying to encode human linguistic intuition into explicit rules, it used statistical properties of language itself.

This approach foreshadowed the data-driven revolution that would transform language AI in the coming decades. While Lesk's method predated modern machine learning by years, it embodied a key insight that would prove prophetic: context carries information, and that information can be captured through surprisingly straightforward computational methods. The algorithm emerged at a time when WordNet was still being designed, when neural networks were out of favor, and when "corpus linguistics" meant analyzing thousands of sentences rather than billions. Yet its core principle.that meaning emerges from the company words keep.would echo through the history of language AI, from distributional semantics to word embeddings to modern transformer models.