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

多文档证据与类知识图谱的结合求解复杂问题

Answering Complex Questions by Joining Multi-Document Evidence with Quasi Knowledge Graphs

Xiaolu Lu, Soumajit Pramanik, Rishiraj Saha Roy, Abdalghani Abujabal, Yafang Wang, Gerhard Weikum

摘要:

直接回答涉及多个实体和关系的问题是基于文本的问答的一个挑战。当只能通过连接来自多个文档的证据来找到答案时,这个问题最为明显。策划的知识图谱(KG)可能会产生很好的答案,但受到其固有的不完整性和潜在的陈旧性的限制。本文提出了QUEST,一种方法,可以回答复杂的问题,直接从文本源上的飞行,通过计算相似连接部分结果从不同的文件。我们的方法是完全无监督的,避免了训练数据的瓶颈,能够应对用户问题中快速发展的特定主题和制定风格。QUEST构建了一个带有节点和边权重的噪声准KG,由动态检索的实体名称和关系短语组成。它用类型和语义对齐来增强这个图,并通过Group Steiner Trees的算法来计算最佳答案。我们评估QUEST的基准复杂的问题,并表明它大大优于国家的最先进的基线。

英文摘要:

Direct answering of questions that involve multiple entities and relations is a challenge for text-based QA. This problem is most pronounced when answers can be found only by joining evidence from multiple documents. Curated knowledge graphs (KGs) may yield good answers, but are limited by their inherent incompleteness and potential staleness. This paper presents QUEST, a method that can answer complex questions directly from textual sources on-the-fly, by computing similarity joins over partial results from different documents. Our method is completely unsupervised, avoiding training-data bottlenecks and being able to cope with rapidly evolving ad hoc topics and formulation style in user questions. QUEST builds a noisy quasi KG with node and edge weights, consisting of dynamically retrieved entity names and relational phrases. It augments this graph with types and semantic alignments, and computes the best answers by an algorithm for Group Steiner Trees. We evaluate QUEST on benchmarks of complex questions, and show that it substantially outperforms state-of-the-art baselines.

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

↑