AI Navigate

N-gram-like Language Models Predict Reading Time Best

arXiv cs.CL / 3/11/2026

Ideas & Deep AnalysisModels & Research

Key Points

  • Recent research shows that state-of-the-art transformer language models, despite their high accuracy in next-word prediction, perform worse than simpler models at predicting human reading time.
  • The study suggests that reading time is more influenced by simple n-gram statistics rather than the complex patterns learned by advanced neural language models.
  • Neural language models whose predictions align closely with n-gram probabilities correlate best with eye-tracking metrics measuring reading time on natural text.
  • This finding challenges the assumption that more complex models inherently provide better cognitive predictions and emphasizes the relevance of simpler statistical features for modeling human reading behavior.

Computer Science > Computation and Language

arXiv:2603.09872 (cs)
[Submitted on 10 Mar 2026]

Title:N-gram-like Language Models Predict Reading Time Best

View a PDF of the paper titled N-gram-like Language Models Predict Reading Time Best, by James A. Michaelov and Roger P. Levy
View PDF
Abstract:Recent work has found that contemporary language models such as transformers can become so good at next-word prediction that the probabilities they calculate become worse for predicting reading time. In this paper, we propose that this can be explained by reading time being sensitive to simple n-gram statistics rather than the more complex statistics learned by state-of-the-art transformer language models. We demonstrate that the neural language models whose predictions are most correlated with n-gram probability are also those that calculate probabilities that are the most correlated with eye-tracking-based metrics of reading time on naturalistic text.
Subjects: Computation and Language (cs.CL)
Cite as: arXiv:2603.09872 [cs.CL]
  (or arXiv:2603.09872v1 [cs.CL] for this version)
  https://doi.org/10.48550/arXiv.2603.09872
Focus to learn more
arXiv-issued DOI via DataCite

Submission history

From: James Michaelov [view email]
[v1] Tue, 10 Mar 2026 16:35:41 UTC (1,176 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled N-gram-like Language Models Predict Reading Time Best, by James A. Michaelov and Roger P. Levy
  • View PDF
  • TeX Source
Current browse context:
cs.CL
< prev   |   next >
Change to browse by:
cs

References & Citations

export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
Links to Code Toggle
Papers with Code (What is Papers with Code?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.