让问答系统主动问清楚模糊问题,提升准确率。
CLEAR-KGQA: Clarification-Enhanced Ambiguity Resolution for Knowledge Graph Question Answering
- 用贝叶斯方法量化模糊度,决定何时该提问澄清
- 在WebQSP和CWQ上准确率显著提升,优于现有方法
- 适合需要高精度问答的场景,如医疗、法律咨询
本研究针对知识图谱问答中的语义模糊问题。尽管近期基于大语言模型(LLMs)的KGQA系统取得进展,但通常假设用户问题无歧义,这与真实场景不符。为此,我们提出一种新框架,通过多轮对话动态处理实体模糊(如名称相似的实体)和意图模糊(如问题的不同理解)。该方法采用贝叶斯推理机制量化查询模糊性,指导LLM判断何时以及如何向用户请求澄清。我们还设计了双代理交互框架,利用基于LLM的用户模拟器,通过模拟用户反馈迭代优化逻辑形式。在WebQSP和CWQ数据集上的实验表明,该方法有效解决语义歧义,显著提升性能。此外,我们构建了一个由交互历史生成的去模糊化查询数据集,以支持未来研究。
原文摘要 · Abstract (English)
This study addresses the challenge of ambiguity in knowledge graph question answering (KGQA). While recent KGQA systems have made significant progress, particularly with the integration of large language models (LLMs), they typically assume user queries are unambiguous, which is an assumption that rarely holds in real-world applications. To address these limitations, we propose a novel framework that dynamically handles both entity ambiguity (e.g., distinguishing between entities with similar names) and intent ambiguity (e.g., clarifying different interpretations of user queries) through interactive clarification. Our approach employs a Bayesian inference mechanism to quantify query ambiguity and guide LLMs in determining when and how to request clarification from users within a multi-turn dialogue framework. We further develop a two-agent interaction framework where an LLM-based user simulator enables iterative refinement of logical forms through simulated user feedback. Experimental results on the WebQSP and CWQ dataset demonstrate that our method significantly improves performance by effectively resolving semantic ambiguities. Additionally, we contribute a refined dataset of disambiguated queries, derived from interaction histories, to facilitate future research in this direction.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。