Skip to content

A Data-free Universal Prior over Syntactic Structures

Sep 2026 · 0 citations · 25 references
Computer Science Physics

TL;DR

It is shown that a universal prior over syntactic structures emerges from a model of human language production, in which words are progressively integrated into syntactic structure, providing a data-independent structural bias for probabilistic models, including large language models.

Abstract

The probabilities of syntactic structures in human languages are assumed to emerge fully from language-specific experience. Here, I show that a universal prior over syntactic structures emerges from a model of human language production, in which words are progressively integrated into syntactic structure. Without fitting any parameters to specific language data, the resulting prior assigns higher probabilities to attested than to random dependency trees in all 138 typologically diverse languages examined. These prior probabilities correlate positively with those estimated from corpora in 33 of 34 languages. The results indicate that part of the probability structure of syntax can arise independently of language-specific learning. This identifies human language production as a possible cognitive source of universal statistical structure in language, while providing a data-independent structural bias for probabilistic models, including large language models.

View source

Similar papers

Open access Sep 2026

Descriptive adequacy and Large Language Models

Generative language models produce unconstrained text with few grammatical errors. But full linguistic competence also requires the ability to associate grammatical sentences with the correct syntactic structures, resulting in the correct semantic interpretations. We performed experiments to establish whether five comm...

E. Ruys, Iris Mulders · 0 citations
#natural language process... Preprint Sep 2026

Neural Language Models Learn the Contextual Distributions of Dependency Structures: a statistical learning theory to compositionality

It is argued that this process provides a statistical-learning account of how NLMs solve the compositionality problem in language, and the possibility that this statistical learning process provides an explanatory theory on how language cognition could emerge from pure distributional statistics.

Bo-Juan Wang, Chen Jun Jie, Holly E. Jenkins et al. · 0 citations
#machine learning Preprint Oct 2026

A theory of platonic representations in language models

Representations of translated sentences are similar in the inner layers of multilingual language models -- an observation connected to the platonic representation hypothesis, yet unexplained theoretically. We provide an explanation based on the assumption that data have a hidden hierarchical structure whose abstract le...

Darshil Doshi, Wen-Jie Zhou, C. Wegner et al. · 0 citations
Open access Sep 2026

The Structural Sources of Verb Meanings Revisited: Large Language Models Display Syntactic Bootstrapping

The results show that models’ verb representations degrade more when the authors perturb word order, which removes syntactic information, than when they perturb co-occurrence among content words, which removes semantic information.

Xiao-Meng Zhu, R. Thomas McCoy, Robert Frank · 0 citations
#machine learning Preprint Oct 2026

Learning to Learn a Language

We present the Prior-Fitted Language Model (PFLM), a 300M-parameter byte-level transformer pretrained only on samples from a synthetic non-linguistic prior. Given a prefix of real text, it learns to predict the language in context with frozen weights, having never seen a word of any real language. Every training sequen...

Lennart Carstens-Behrens, Holger Fröhlich · 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.