Not quite Sherlock Holmes: Language model predictions do not reliably differentiate impossible from improbable events

James A. Michaelov, Reeka Estacio, Zhien Zhang, Benjamin K. Bergen
6/7/2025
cs.CLcs.AI

No confident code implementation found for this paper.

Abstract

Can language models reliably predict that possible events are more likely than merely improbable ones? By teasing apart possibility, typicality, and contextual relatedness, we show that despite the results of previous work, language models' ability to do this is far from robust. In fact, under certain conditions, all models tested - including Llama 3, Gemma 2, and Mistral NeMo - perform at worse-than-chance level, assigning higher probabilities to impossible sentences such as 'the car was given a parking ticket by the brake' than to merely unlikely sentences such as 'the car was given a parking ticket by the explorer'.

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{michaelov2025quite,
  title  = {Not quite Sherlock Holmes: Language model predictions do not reliably differentiate impossible from improbable events},
  author = {James A. Michaelov and Reeka Estacio and Zhien Zhang and Benjamin K. Bergen},
  year   = {2025},
  eprint = {2506.06808},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.06808v1}
}

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

Discussion