首页> 外文会议>International conference on language resources and evaluation >Challenges in the Knowledge Base Population Slot Filling Task
【24h】

Challenges in the Knowledge Base Population Slot Filling Task

机译:知识库人口插槽填充任务中的挑战

获取原文

摘要

The Knowledge Based Population (KBP) evaluation track of the Text Analysis Conferences (TAC) has been held for the past 3 years. One of the two tasks of KBP is slot filling: finding within a large corpus the values of a set of attributes of given people and organizations. This task has proven very challenging, with top systems rarely exceeding 30% F-measure. In this paper, we present an error analysis and classification for those answers which could be found by a manual corpus search but were not found by any of the systems participating in the 2010 evaluation. The most common sources of failure were limitations on inference, errors in coreference (particularly with nominal anaphors), and errors in named entity recognition. We relate the types of errors to the characteristics of the task and show the wide diversity of problems that must be addressed to improve overall performance.
机译:文本分析会议(TAC)的基于知识的人口(KBP)评估活动已举行了近3年。 KBP的两项任务之一是填补空缺:在大型语料库中查找给定人员和组织的一组属性的值。实践证明,这项任务非常具有挑战性,顶级系统很少会超过30%的F值。在本文中,我们对这些答案进行了错误分析和分类,这些答案可以通过手动语料库搜索找到,但任何参与2010年评估的系统都找不到。失败的最常见原因是推理的局限性,共指称中的错误(尤其是名义照应)以及命名实体识别中的错误。我们将错误的类型与任务的特征相关联,并显示出为提高整体性能而必须解决的各种问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号