A Benchmark for Open-Domain Numerical Fact-Checking Enhanced by Claim Decomposition
V Venktesh, Deepali Prabhu, Avishek Anand

TL;DR
This paper introduces QuanTemp++, a benchmark dataset for open-domain numerical fact-checking that emphasizes realistic evidence retrieval through claim decomposition, aiming to improve automated verification of numerical claims.
Contribution
The paper presents QuanTemp++, a new dataset with natural numerical claims and evidence collected via claim decomposition, avoiding temporal leakage and improving realism in fact-checking benchmarks.
Findings
Claim decomposition improves evidence relevance.
Verification accuracy benefits from realistic retrieval settings.
Analysis of retrieval paradigms highlights their impact on verification outcomes.
Abstract
Fact-checking numerical claims is critical as the presence of numbers provide mirage of veracity despite being fake potentially causing catastrophic impacts on society. The prior works in automatic fact verification do not primarily focus on natural numerical claims. A typical human fact-checker first retrieves relevant evidence addressing the different numerical aspects of the claim and then reasons about them to predict the veracity of the claim. Hence, the search process of a human fact-checker is a crucial skill that forms the foundation of the verification process. Emulating a real-world setting is essential to aid in the development of automated methods that encompass such skills. However, existing benchmarks employ heuristic claim decomposition approaches augmented with weakly supervised web search to collect evidences for verifying claims. This sometimes results in less relevant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
