MUCH: A Multilingual Claim Hallucination Benchmark

Jérémie Dentan, Alexi Canesse, Davide Buscaldi, Aymen Shabou, Sonia Vanier
11/21/2025
cs.CL

No official code found. Best implementation: orailix/much (2 stars, Apache-2.0, last commit 2026-01-14).

Abstract

Claim-level Uncertainty Quantification (UQ) is a promising approach to mitigate the lack of reliability in Large Language Models (LLMs). We introduce MUCH, the first claim-level UQ benchmark designed for fair and reproducible evaluation of future methods under realistic conditions. It includes 4,873 samples across four European languages (English, French, Spanish, and German) and four instruction-tuned open-weight LLMs. Unlike prior claim-level benchmarks, we release 24 generation logits per token, facilitating the development of future white-box methods without re-generating data. Moreover, in contrast to previous benchmarks that rely on manual or LLM-based segmentation, we propose a new deterministic algorithm capable of segmenting claims using as little as 0.2% of the LLM generation time. This makes our segmentation approach suitable for real-time monitoring of LLM outputs, ensuring that MUCH evaluates UQ methods under realistic deployment constraints. Finally, our evaluations show that current methods still have substantial room for improvement in both performance and efficiency.

View on arXivView PDF

Code Implementations(1)

orailix/muchCommunity65%
Apache-2.0

MUCH : A Multilingual Claim Hallucination Benchmark

20Shell, PythonNov 21, 20259 months agoApache-2.0

Cite this paper

@article{dentan2025much,
  title  = {MUCH: A Multilingual Claim Hallucination Benchmark},
  author = {Jérémie Dentan and Alexi Canesse and Davide Buscaldi and Aymen Shabou and Sonia Vanier},
  year   = {2025},
  eprint = {2511.17081},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.17081v2}
}

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

Discussion