The unreasonable effectiveness of pattern matching

Gary Lupyan, Blaise Agüera y Arcas
1/16/2026
cs.CL

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lupyan2026unreasonable,
  title  = {The unreasonable effectiveness of pattern matching},
  author = {Gary Lupyan and Blaise Agüera y Arcas},
  year   = {2026},
  eprint = {2601.11432},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.11432v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.11432.svg)](https://codeofpaper.com/paper/2601.11432)

Discussion