STRUCTURALCOST: A controlled reading time dataset for modeling human sentence processing difficulty

Nina Nusbaumer, Iria de-Dios-Flores, Corentin Bel, Christophe Pallier, Guillaume Wisniewski +1 more
10/6/2026
cs.CLcs.AI

No confident code implementation found for this paper.

Abstract

We introduce STRUCTURALCOST, a self-paced reading dataset of 475 participants and 40,800 observations isolating the processing cost of long-distance subject-verb dependency resolution. We replicate a low-powered psycholinguistic finding at NLP scale, namely that human reading times at the main verb increase with dependency length, driven by syntactic embedding beyond linear distance. Different language models -- spanning n-gram models, SSMs, and transformers -- partially mirror this graded difficulty profile, yet underestimate the integration cost humans incur, with a gap that persists across architectures and model sizes. This suggests these models capture the predictive component of human processing but not the full integration cost that working memory imposes. STRUCTURALCOST provides data needed to drive progress toward evaluating the cognitive plausibility of language models.

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{nusbaumer2026structuralcost,
  title  = {STRUCTURALCOST: A controlled reading time dataset for modeling human sentence processing difficulty},
  author = {Nina Nusbaumer and Iria de-Dios-Flores and Corentin Bel and Christophe Pallier and Guillaume Wisniewski and Benoît Crabbé},
  year   = {2026},
  eprint = {2610.08208},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.08208v1}
}

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/2610.08208.svg)](https://codeofpaper.com/paper/2610.08208)

Discussion