首页> 外文会议>Conference of the European Chapter of the Association for Computational Linguistics >Trust, but Verify! Better Entity Linking through Automatic Verification
【24h】

Trust, but Verify! Better Entity Linking through Automatic Verification

机译:信任但要验证!通过自动验证更好的实体链接

获取原文

摘要

We introduce automatic verification as a post-processing step for entity linking (EL). The proposed method trusts EL sys tem results collectively, by assuming en tity mentions are mostly linked correctly, in order to create a semantic profile of the given text using geospatial and temporal information, as well as fine-grained entity types. This profile is then used to auto matically verify each linked mention indi vidually, i.e., to predict whether it has been linked correctly or not. Verification allows leveraging a rich set of global and pairwise features that would be prohibitively expen sive for EL systems employing global in ference. Evaluation shows consistent im provements across datasets and systems. In particular, when applied to state-of-the-art systems, our method yields an abso lute improvement in linking performance of up to 1.7 Fl on AIDA/CoNLL'03 and up to 2.4 Fl on the English TAC KBP 2015 TEDL dataset.
机译:我们将自动验证作为实体链接(EL)的后处理步骤。所提出的方法通过假设实体链接大多正确链接来集体信任EL系统结果,以便使用地理空间和时间信息以及细粒度的实体类型创建给定文本的语义配置文件。然后,使用此配置文件自动自动地分别验证每个链接的提及,即预测是否已正确链接。验证允许利用丰富的全局和成对特征集,这对于采用全局引用的EL系统来说是昂贵的。评估显示跨数据集和系统的一致改进。特别是,当将其应用于最先进的系统时,我们的方法在AIDA / CoNLL'03上的链接性能高达1.7 Fl,在英语TAC KBP 2015 TEDL数据集上的链接高达2.4 Fl,产生了绝对的改善。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号