Mar 2026· arXiv.org· Vol abs/2603.16574· 2 citations· 48 references
Computer Science
TL;DR
It is concluded that current transformer models do not explain human morphosyntactic processing, and that evaluations of transformers as cognitive models must adopt rigorous, comprehensive experimental designs to avoid spurious generalizations from isolated syntactic configurations or individual models.
Abstract
Transformers underlie almost all state-of-the-art language models in computational linguistics, yet their cognitive adequacy as models of human sentence processing remains disputed. In this work, we use a surprisal-based linking mechanism to systematically evaluate eleven autoregressive transformers of varying sizes and architectures on a more comprehensive set of English agreement attraction configurations than prior work. Our experiments yield mixed results: While transformer predictions generally align with human reading time data for prepositional phrase configurations, performance degrades significantly on object-extracted relative clause configurations. In the latter case, predictions also diverge markedly across models, and no model successfully replicates the asymmetric interference patterns observed in humans. We conclude that current transformer models do not explain human morphosyntactic processing, and that evaluations of transformers as cognitive models must adopt rigorous, comprehensive experimental designs to avoid spurious generalizations from isolated syntactic configurations or individual models.
This work systematically vary the context window size of GPT-2 across four large-scale naturalistic English reading-time datasets and observes a U-shaped relationship, demonstrating that tracking long-range coreference relations is one important factor for the alignment between LM surprisal and human reading behavior.
Kohei Kajikawa, Lin Ai, Tatsuki Kuribayashi et al.· 0 citations
A two-layer LSTM language model trained on 250M morphemes of Hindi data can capture the relatively complex interaction between case and agreement in Hindi-Urdu, and it is shown that this model encodes case-marking linearly, implementing a geometrically intuitive and inter-pretable syntactic processing mechanism.
Satoru Ozaki, Rajesh Bhatt, Brian Dillon· 2 citations
Abstract Memory limitations have been assumed to be a major factor shaping human sentence comprehension, but characterizing memory-demanding structures in a broad-coverage and cross-linguistic manner has remained a challenge. A recent study suggested that such a general characterization can be obtained by assuming effi...
Shinnosuke Isono, Kohei Kajikawa, Yohei Oseki et al.· Open Mind· 2 citations
This work investigates whether enriching text with syntactic and rhetorical information can improve incoherence prediction, and shows that plain texts achieved higher accuracy because the added information was structurally and syntactically incompatible with the language model's architecture.
V. Mazzotti, Luiz Pereira, Marina Bitencourt dos Santos et al.· 0 citations
Some properties of languages, e.g., subject-object-verb (SOV) word order, are more prevalent than others among the thousands of attested natural languages (NLs). Such typological commonality is often attributed to learning biases. Computational simulations, recently with language models (LMs), have facilitated the expl...
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· microsoft.comOct 15, 2026
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· news.mit.eduSep 24, 2026