LINGOLY: A Benchmark of Olympiad-Level Linguistic Reasoning Puzzles in Low-Resource and Extinct Languages

Andrew M. Bean, Simi Hellsten, Harry Mayne, Jabez Magomere, Ethan A. Chi +3 more
2/3/2026

No official code found. Best implementation: am-bean/lingOly (12 stars, last commit 2025-03-03).

Abstract

In this paper, we present the LingOly benchmark, a novel benchmark for advanced reasoning abilities in large language models. Using challenging Linguistic Olympiad puzzles, we evaluate (i) capabilities for in-context identification and generalisation of linguistic patterns in very low-resource or extinct languages, and (ii) abilities to follow complex task instructions. The LingOly benchmark covers more than 90 mostly low-resource languages, minimising issues of data contamination, and contains 1,133 problems across 6 formats and 5 levels of human difficulty. We assess performance with both direct accuracy and comparison to a no-context baseline to penalise memorisation. Scores from 11 state-of-the-art LLMs demonstrate the benchmark to be challenging, and models perform poorly on the higher difficulty problems. On harder problems, even the top model only achieved 38.7% accuracy, a 24.7% improvement over the no-context baseline. Large closed models typically outperform open models, and in general, the higher resource the language, the better the scores. These results indicate, in absence of memorisation, true multi-step out-of-domain reasoning remains a challenge for current language models.

View on arXivView PDF

Code Implementations(1)

am-bean/lingOlyCommunity100%

A benchmark for language models based on the UK Linguistics Olympiad

122HTML, ShellApr 10, 20241 years agoNOASSERTION

Similar Papers

Cite this paper

@article{bean2026lingoly,
  title  = {LINGOLY: A Benchmark of Olympiad-Level Linguistic Reasoning Puzzles in Low-Resource and Extinct Languages},
  author = {Andrew M. Bean and Simi Hellsten and Harry Mayne and Jabez Magomere and Ethan A. Chi and Ryan Chi and Scott A. Hale and Hannah Rose Kirk},
  year   = {2026},
  eprint = {2406.06196},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2406.06196},
  url    = {https://arxiv.org/abs/2406.06196},
  journal = {NEURIPS 2024 2024}
}

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

Discussion