The unreasonable effectiveness of pattern matching
Gary Lupyan, Blaise Agüera y Arcas
TL;DR
The paper addresses how to conceptualize large language models (LLMs) by showing that they function as powerful pattern-matching engines whose capabilities expand with data and scale, rather than as simple databases or blurry representations of the web. Through Jabberwocky-like texts and The Gostak, it demonstrates that LLMs can recover meaning by leveraging syntactic patterns and contextual cues, effectively deblurring degraded inputs via structural fingerprints. It connects these findings to construction grammar, arguing that language consists of patterns ranging from specific constructions to abstract templates, which constrain interpretation. The overarching thesis is that pattern matching is a general cognitive principle that underpins LLM success and broader intelligence, offering a unifying lens for AI, cognition, and the limits of current metaphors like “universal mimic” or “blurry JPEG of the web.”
Abstract
We report on an astonishing ability of large language models (LLMs) to make sense of "Jabberwocky" language in which most or all content words have been randomly replaced by nonsense strings, e.g., translating "He dwushed a ghanc zawk" to "He dragged a spare chair". This result addresses ongoing controversies regarding how to best think of what LLMs are doing: are they a language mimic, a database, a blurry version of the Web? The ability of LLMs to recover meaning from structural patterns speaks to the unreasonable effectiveness of pattern-matching. Pattern-matching is not an alternative to "real" intelligence, but rather a key ingredient.
