...
首页> 外文期刊>Knowledge-Based Systems >Knowledge Graph Question Answering with semantic oriented fusion model
【24h】

Knowledge Graph Question Answering with semantic oriented fusion model

机译:知识图表问题用语义定向融合模型回答

获取原文
获取原文并翻译 | 示例
           

摘要

Knowledge Graph Question Answering (KGQA) is a major branch of question answering tasks, which can answer fact questions effectively by using the reasonable characteristics of the knowledge graph. Currently, lots of related works combined with a variety of deep learning models are presented for the KGQA task. However, there are still some challenges, such as topic entity recognition under ambiguity expression, semantic level representation of natural language, efficient construction of searching space for answers, etc. In this paper, we propose a comprehensive approach for complex question answering over KG. Firstly, during the stage of topic entity recognition, a deep transition model is constructed to extract topic entities, and an efficient entity linking strategy is presented, which combines character matching and entity disambiguation model. Secondly, for candidate path ranking, a dynamic candidate path generation algorithm is proposed to efficiently create the candidate answer set. And four dedicated similarity calculation models are designed to handle the intricate condition of complex questions with long sequence and diversity expression. Moreover, a fusion policy is proposed to make decision for the final correct answer. We evaluate our approach on CKBQA, a Chinese knowledge base question answering dataset, from CCKS2019 competition. Experimental results demonstrate that the improvements in each process are effective and our approach achieves better performance than the best team in CCKS2019 competition. (c) 2021 Elsevier B.V. All rights reserved.
机译:知识图表问题应答(kgqa)是问题回答任务的主要分支,可以通过使用知识图的合理特征有效地回答事实问题。目前,为kgqa任务提供了许多相关的工作与各种深度学习模型相结合。然而,仍存在一些挑战,如主题实体识别,如歧义表达,语义级别表示自然语言,高效施工的搜索空间的答案等。在本文中,我们提出了一种在KG上回答的复杂问题的综合方法。首先,在主题实体识别的阶段,构建深度转换模型以提取主题实体,并呈现有效的实体链接策略,其组合了字符匹配和实体消除歧义模型。其次,对于候选路径排名,提出了一种动态候选路径生成算法以有效地创建候选答案集。和四种专用相似性计算模型旨在处理具有长序列和多样性表达的复杂问题的复杂条件。此外,提出了融合政策,以决定最终正确答案。从CCKS2019竞争中,我们评估了我们在CKBQA,这是一个中国知识库问题应答数据集的方法。实验结果表明,每个过程的改进都是有效的,我们的方法比CCKS2019竞争中的最佳团队实现更好的性能。 (c)2021 elestvier b.v.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号