EDG-Based Question Decomposition for Complex Question Answering over Knowledge Bases

SEMANTIC WEB - ISWC 2021(2021)

引用 19|浏览20
暂无评分
摘要
Knowledge base question answering (KBQA) aims at automatically answering factoid questions over knowledge bases (KBs). For complex questions that require multiple KB relations or constraints, KBQA faces many challenges including question understanding, component linking (e.g., entity, relation, and type linking), and query composition. In this paper, we propose a novel graph structure called Entity DescriptionGraph (EDG) to represent the structure of complex questions, which can help alleviate the above issues. By leveraging the EDG structure of given questions, we implement a QA system over DBpedia, called EDGQA. Extensive experiments demonstrate that EDGQA outperforms state-of-the-art results on both LC-QuAD and QALD-9, and that EDG-based decomposition is a feasible way for complex question answering over KBs.
更多
查看译文
关键词
Entity description graph, Question answering, Question decomposition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要