arXiv:2502.20317cs.LGcs.AI2025-02ACL被引 11

融合结构与文本检索,提升复杂查询回答效果

Mixture of Structural-and-Textual Retrieval over Text-rich Graph Knowledge Bases

  • 设计规划-推理-组织框架,协同处理结构与文本信息
  • 在多个数据集上显著优于现有方法,提升检索精度
  • 适合需要联合利用知识图谱结构与文本的问答系统

文本丰富的图知识库(TG-KBs)在回答查询时同时提供文本与结构化知识,但现有方法常孤立处理两类知识,或在邻域聚合后忽略结构检索。为此,我们提出结构与文本检索混合模型(MoR),采用规划-推理-组织框架:规划阶段生成描述答案逻辑的文本规划图;推理阶段交织结构遍历与文本匹配,从TG-KBs中获取候选;组织阶段基于候选的结构轨迹进行重排序。大量实验表明,MoR能有效协调两类检索,揭示不同查询逻辑下的性能差异,并证实结构轨迹对候选重排序具有显著增益。代码已开源。

原文摘要 · Abstract (English)

Text-rich Graph Knowledge Bases (TG-KBs) have become increasingly crucial for answering queries by providing textual and structural knowledge. However, current retrieval methods often retrieve these two types of knowledge in isolation without considering their mutual reinforcement and some hybrid methods even bypass structural retrieval entirely after neighboring aggregation. To fill in this gap, we propose a Mixture of Structural-and-Textual Retrieval (MoR) to retrieve these two types of knowledge via a Planning-Reasoning-Organizing framework. In the Planning stage, MoR generates textual planning graphs delineating the logic for answering queries. Following planning graphs, in the Reasoning stage, MoR interweaves structural traversal and textual matching to obtain candidates from TG-KBs. In the Organizing stage, MoR further reranks fetched candidates based on their structural trajectory. Extensive experiments demonstrate the superiority of MoR in harmonizing structural and textual retrieval with insights, including uneven retrieving performance across different query logics and the benefits of integrating structural trajectories for candidate reranking. Our code is available at https://github.com/Yoega/MoR.

知识图谱检索增强问答系统

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。