首页> 外文会议>Annual meeting of the Association for Computational Linguistics >Matching the Blanks: Distributional Similarity for Relation Learning
【24h】

Matching the Blanks: Distributional Similarity for Relation Learning

机译:匹配空白:与关系学习的分配相似性

获取原文

摘要

General purpose relation extractors, which can model arbitrary relations, are a core aspiration in information extraction. Efforts have been made to build general purpose extractors that represent relations with their surface forms, or which jointly embed surface forms with relations from an existing knowledge graph. However, both of these approaches are limited in their ability to generalize. In this paper, we build on extensions of Harris" distributional hypothesis to relations, as well as recent advances in learning text representations (specifically, BERT), to build task agnostic relation representations solely from entity-linked text. We show that these representations significantly outperform previous work on exemplar based relation extraction (FewRel) even without using any of that task's training data. We also show that models initialized with our task agnostic representations, and then tuned on supervised relation extraction datasets. significantly outperform the previous methods on Se-mEval 2010 Task 8, KBP37. and TACRED.
机译:可以模拟任意关系的通用关系提取器是信息提取中的核心愿望。已经努力建立代表与其表面形式关系的通用提取器,或者与现有知识图中的关系共同嵌入表面形式。然而,这两种方法都受到泛化能力的限制。在本文中,我们建立了哈里斯“分布假设与关系的扩展,以及学习文本表示的最新进展(特别是BERT),仅仅从实体联系的文本构建任务不可知情的关系表示。我们表明这些陈述显着胜过以前的基于示例的关系提取(几只rel)即使不使用任何任务的训练数据。我们还表明使用我们的任务不可知表示初始化的模型,然后在监督的关系提取数据集上调整。显着优于先前的方法 - Meval 2010任务8,KBP37。并默克雷德。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号