首页> 外文会议>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:一个名为Enticity歧义方法,用于知识库的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.
机译:问题应答系统(QASS)通常被建立在短文本描述的查询后面。知识图表和链接开放数据的爆炸激励了在这些丰富的数据资源上构建QASS的研究人员。用户问题的短缺性质有助于使实体链接问题复杂化,广泛研究了长文本。本文基于给定查询的实体的上下文和类型,提出了一种称为Welink的方法。实体的上下文由问题中使用的单词的同义词和命名实体的定义来描述,而该类型描述了实体的类别。在命名实体识别步骤中,我们首先识别不同的实体,它们的类型和上下文(通过Wordnet的手段)。然后在目标知识库上执行扩展查询,其中几个候选是使用它们的上下文和类型获得的。计算这些不同的上下文和类型之间的相似性距离,以便选择相应的候选者。最后,我们的系统是在具有5000个问题的数据集上进行评估,并与一些着名的实体链接系统进行比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号