Skip to content

A Formal Limitation on Learning Human Language From Textual Corpora

Aug 2026 · 0 citations · 49 references
Computer Science

TL;DR

Modeling language use as a joint distribution over meanings, contexts, and utterances, upper bounds are derived on the probability that a decoder recovers a speaker's intended meaning from a representation of the utterance.

Abstract

Can a listener recover what a speaker means from the form of an utterance alone? We answer this question information-theoretically, and for a listener given by any featurizer of text, including the hidden states of contemporary large language models. Modeling language use as a joint distribution over meanings, contexts, and utterances, we derive upper bounds on the probability that a decoder recovers a speaker's intended meaning from a representation of the utterance. The bounds are governed by the uncertainty that form leaves about meaning, which splits into an irreducible part and a part that only (extralinguistic) context, but never the utterance alone, can resolve. Because these quantities are intrinsic to language, no representation, however much text or supervision produced it, can surpass them. The bounds apply, moreover, to meaning spaces that are discrete or continuous. We provide empirical evidence in support of the theory through experiments on artificial languages, Mandarin zero-pronoun resolution, and color reference.

View source

Similar papers

Review Aug 2026

Developing a naturalistic approach for an experimental question: Perception of acoustically ambiguous phonemes within semantically disambiguating discourse

While acoustic details such as voice onset time can be informative as to the identity of a phoneme (e.g., GOAT versus COAT), these details are not always reliable. Fortunately, disambiguating cues can often be found elsewhere, such as the semantic context. Indeed, acoustically ambiguous phonemes can be perceptually bia...

Mel Mallard, Kristin J. Van Engen · 0 citations

Exposure is Optional: Learning Unlike Coordination in Language Models

Analysis of internal representations indicate that language models process unlike coordination by treating the conjoined elements as belonging to similar structural categories or through a mechanism akin to deletion, both of which appear learnable from exposure to alike coordination alone.

Jiamu Luo, Shane Steinert-Threlkeld · 0 citations
Preprint Aug 2026

Can We Read the Mind of an Audio LLM? A Verbalizable, Multilingual Middle-Layer Workspace

Reading a base Qwen3-Omni with a logit lens at the audio-token positions, it is found that the answer to a spoken question becomes legible - in words - in the model's middle layers, before it emits any token.

Jia-Jun Fan, Jing-Yuan Li, Prashanth Gurunath Shivakumar et al. · 0 citations
Preprint Aug 2026

Language models suffer from a curse of ambiguity

This work identifies a curse of ambiguity: in large language models, and more broadly in all neural networks that produce discrete probability distributions, the more ambiguous a next-token distribution is, the harder it is to learn accurately.

Nicolas Zucchet, Hyun Dong Lee, Scott W. Linderman · 2 citations
Preprint Aug 2026

When Is Noise Response Universal? Tokenization as the Hidden Variable in Language Models

The degradation rate across neural models, both sentence embeddings and decoder-only LLMs, is studied, and how consistent it is depends on the scale of the noise: under word-level noise, models with very different architectures decline along nearly the same curve, while under character-level noise they separate.

Ye-Fan Tao, Gerald Friedland, Lu-Yang Kong · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.