MUCH: A Multilingual Claim Hallucination Benchmark
Jérémie Dentan, Alexi Canesse, Davide Buscaldi, Aymen Shabou, Sonia Vanier
TL;DR
MUCH catalogs the reliability of LLM outputs through a multilingual claim-level uncertainty benchmark, providing 4 languages, 4 open-weight models, and 24 per-token logits to enable white-box UQ research. It introduces much_segmenter, a fast deterministic claim segmentation tool, and automates claim-level annotations via GPT-4o and GPT-4.1 with a gold-standard human subset for quality checks. The dataset comprises 4.8k samples and 20,751 claims, accompanied by generation configurations and runtime statistics to support real-time deployment considerations. Evaluations of existing baselines reveal meaningful performance gaps and efficiency trade-offs, underscoring the need for stronger, language-robust, and computation-efficient claim-level UQ methods. Overall, MUCH advances fair, reproducible, and deployment-aware evaluation for multilingual claim-level uncertainty quantification, providing a solid foundation for future white-box UQ research.
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.
