首页> 外文会议>International conference on flexible query answering systems >WeLink: A Named Entity Disambiguation Approach for a QAS over Knowledge Bases
【24h】

WeLink: A Named Entity Disambiguation Approach for a QAS over Knowledge Bases

机译:WeLink:基于知识库的QAS的命名实体消歧方法

获取原文

摘要

Question Answering Systems (QASs) are usually built behind queries described by short texts. The explosion of knowledge graphs and Linked Open Data motivates researchers for constructing QASs over these rich data resources. The shortness nature of user questions contributes to complicate the problem of Entity Linking, widely studied for long texts. In this paper, we propose an approach, called WeLink, based on the context and types of entities of a given query. The context of an entity is described by synonyms of the words used in the question and the definition of the named entity, whereas the type describes the category of the entity. During the named entity recognition step, we first identify different entities, their types, and contexts (by the means of the Wordnet). The expanded query is then executed on the target knowledge base, where several candidates are obtained with their contexts and types. Similarity distances among these different contexts and types are computed in order to select the appropriate candidate. Finally, our system is evaluated on a dataset with 5000 questions and compared with some well-known Entity Linking systems.
机译:问答系统(QAS)通常建立在简短文字描述的查询后面。知识图和链接开放数据的爆炸式增长激发了研究人员在这些丰富的数据资源上构建QAS的动机。用户问题的简短性使对长文本进行广泛研究的实体链接问题变得复杂。在本文中,我们基于给定查询的上下文和实体类型,提出了一种称为WeLink的方法。实体的上下文由问题中使用的单词的同义词和命名实体的定义来描述,而类型则描述实体的类别。在命名实体识别步骤中,我们首先(通过Wordnet)识别不同的实体,它们的类型和上下文。然后,在目标知识库上执行扩展的查询,在该知识库中获取具有其上下文和类型的多个候选对象。计算这些不同上下文和类型之间的相似距离,以便选择适当的候选者。最后,我们的系统在具有5000个问题的数据集上进行了评估,并与一些知名的Entity Linking系统进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号