N-gram-like Language Models Predict Reading Time Best

James A. Michaelov, Roger P. Levy
3/10/2026
cs.CL

No confident code implementation found for this paper. 2 possible matches can be shown below.

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.

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. 2 weaker matches are hidden by default — 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{michaelov2026ngramlike,
  title  = {N-gram-like Language Models Predict Reading Time Best},
  author = {James A. Michaelov and Roger P. Levy},
  year   = {2026},
  eprint = {2603.09872},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.09872v1}
}

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

Discussion