首页> 外文期刊>Turkish Journal of Electrical Engineering and Computer Sciences >Relation extraction via one-shot dependency parsing on intersentential, higher-order, and nested relations
【24h】

Relation extraction via one-shot dependency parsing on intersentential, higher-order, and nested relations

机译:通过对句子间,高阶和嵌套关系的一键式依赖关系解析来提取关系

获取原文
           

摘要

Relation extraction via one-shot dependency parsing on intersentential, higher-order, and nested relations Authors: G?ZDE GüL ?AH?N, ERDEM EMEKL?G?L, SE??L ARSLAN, ONUR A?IN, GüL?EN ERY???T Abstract: Despite the emergence of digitalization, people still interact with institutions via traditional means such as submitting free formatted petitions, orders, or applications. These noisy documents generally consist of complex relations that are nested, higher-order, and intersentential. Most of the current approaches address extraction of only sentence-level and binary relations from grammatically correct text and generally require high-level linguistic features coming from preprocessors such as a parts-of-speech tagger, chunker, or syntactic parser. In this article, we focus on extracting complex relations in order to automate the task of understanding user intentions. We propose a novel language-agnostic and noise-immune approach that does not require preprocessing of input text. Unlike previous literature that uses dependency parsing outputs as input features, we formulate the relation extraction task directly as a one-shot dependency parsing problem. The presented method was evaluated using a representative dataset from the banking domain and obtained 91.84% labeled attachment score (LAS), which provides an improvement of 42.85 percentage points over a rule-based baseline. Keywords: Natural language processing, relation extraction, dependency parsing Full Text: PDF.
机译:通过对句子间,高阶和嵌套关系的一键式依赖关系解析来提取关系作者:G?ZDEGüL?AH?N,ERDEM EMEKL?G?L,SE ?? L ARSLAN,ONUR A?IN,GüL?EN ERY ??? T摘要:尽管数字化的出现,人们仍然通过传统方式与机构进行交互,例如提交自由格式的请愿书,命令或申请。这些嘈杂的文档通常由嵌套,高级和句子间的复杂关系组成。当前大多数方法仅解决从语法正确的文本中提取句子级和二进制关系的问题,并且通常需要来自预处理器(例如词性标记器,分块器或语法分析器)的高级语言功能。在本文中,我们专注于提取复杂的关系,以使了解用户意图的任务自动化。我们提出了一种新颖的语言不可知且抗噪声的方法,不需要对输入文本进行预处理。与以前的使用依赖关系解析输出作为输入特征的文献不同,我们将关系提取任务直接公式化为一次依赖解析问题。使用来自银行领域的代表性数据集对提出的方法进行了评估,并获得了91.84%的标记附着分数(LAS),与基于规则的基准相比,该分数提高了42.85个百分点。关键字:自然语言处理,关系提取,依赖项解析全文:PDF。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号