Decomposition Dilemmas: Does Claim Decomposition Boost or Burden Fact-Checking Performance?

Qisheng Hu, Quanyu Long, Wenya Wang


Abstract
Fact-checking pipelines increasingly adopt the Decompose-Then-Verify paradigm, where texts are broken down into smaller claims for individual verification and subsequently combined for a veracity decision. While decomposition is widely-adopted in such pipelines, its effects on final fact-checking performance remain underexplored. Some studies have reported improvements from decompostition, while others have observed performance declines, indicating its inconsistent impact. To date, no comprehensive analysis has been conducted to understand this variability. To address this gap, we present an in-depth analysis that explicitly examines the impact of decomposition on downstream verification performance. Through error case inspection and experiments, we introduce a categorization of decomposition errors and reveal a trade-off between accuracy gains and the noise introduced through decomposition. Our analysis provides new insights into understanding current system’s instability and offers guidance for future studies toward improving claim decomposition in fact-checking pipelines.
Anthology ID:
2025.naacl-long.320
Volume:
Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers)
Month:
April
Year:
2025
Address:
Albuquerque, New Mexico
Editors:
Luis Chiruzzo, Alan Ritter, Lu Wang
Venue:
NAACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
6313–6336
Language:
URL:
https://preview.aclanthology.org/fix-sig-urls/2025.naacl-long.320/
DOI:
Bibkey:
Cite (ACL):
Qisheng Hu, Quanyu Long, and Wenya Wang. 2025. Decomposition Dilemmas: Does Claim Decomposition Boost or Burden Fact-Checking Performance?. In Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), pages 6313–6336, Albuquerque, New Mexico. Association for Computational Linguistics.
Cite (Informal):
Decomposition Dilemmas: Does Claim Decomposition Boost or Burden Fact-Checking Performance? (Hu et al., NAACL 2025)
Copy Citation:
PDF:
https://preview.aclanthology.org/fix-sig-urls/2025.naacl-long.320.pdf