arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.01355cs.AI
收藏

无结构文本上的聚合查询:基准测试与代理方法

Aggregation Queries over Unstructured Text: Benchmark and Agentic Method

Southeast University(东南大学);Imperial College London(伦敦帝国学院);The University of Manchester(曼彻斯特大学)

Haojia Zhu, Qinyuan Xu, Haoyu Li, Yuxi Liu, Hanchen Qiu, Jiaoyan Chen, Jiahui Jin

AI总结:

本文提出DFA方法,用于在无结构文本上进行完整性导向的聚合查询,通过模块化设计提升证据覆盖能力。

摘要:

在自由文本上进行聚合查询是一个长期存在但尚未充分探索的问题。与普通问答不同,聚合查询要求进行详尽的证据收集,系统需要“找到所有”,而不仅仅是“找到一个”。现有范式如文本到SQL和检索增强生成未能实现这种完整性。在本工作中,我们正式在受限语料库的环境下,对文本中的实体级聚合查询进行了规范化,提出了严格完整性要求。为实现原则性评估,我们引入AGGBench,一个用于在大规模真实语料库中评估以完整性为导向的聚合的基准测试。为了配合该基准测试,我们提出了DFA(歧义消除-过滤-聚合),一种模块化的代理基线,将聚合查询分解为可解释的阶段,并暴露与歧义、过滤和聚合相关的关键失败模式。实验结果表明,DFA在强RAG和代理基线上 consistently 提高了聚合证据覆盖。数据和代码可在 \href{https://anonymous.4open.science/r/DFA-A4C1} 获取。

英文摘要:

Aggregation query over free text is a long-standing yet underexplored problem. Unlike ordinary question answering, aggregate queries require exhaustive evidence collection and systems are required to "find all," not merely "find one." Existing paradigms such as Text-to-SQL and Retrieval-Augmented Generation fail to achieve this completeness. In this work, we formalize entity-level aggregation querying over text in a corpus-bounded setting with strict completeness requirement. To enable principled evaluation, we introduce AGGBench, a benchmark designed to evaluate completeness-oriented aggregation under realistic large-scale corpus. To accompany the benchmark, we propose DFA (Disambiguation--Filtering--Aggregation), a modular agentic baseline that decomposes aggregation querying into interpretable stages and exposes key failure modes related to ambiguity, filtering, and aggregation. Empirical results show that DFA consistently improves aggregation evidence coverage over strong RAG and agentic baselines. The data and code are available in \href{https://anonymous.4open.science/r/DFA-A4C1}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑