OpenIE6: Iterative Grid Labeling and Coordination Analysis for Open Information Extraction

• URL: http://arxiv.org/abs/2010.03147v1
• Date: Wed, 7 Oct 2020 04:05:37 GMT
• Title: OpenIE6: Iterative Grid Labeling and Coordination Analysis for Open Information Extraction
• Authors: Keshav Kolluru, Vaibhav Adlakha, Samarth Aggarwal, Mausam, and Soumen Chakrabarti
• Abstract summary: We present an iterative labeling-based system that establishes a new state of the art for OpenIE, while extracting 10x faster. This is achieved through a novel Iterative Grid Labeling (IGL) architecture, which treats OpenIE as a 2-D grid labeling task. Our OpenIE system, OpenIE6, beats the previous systems by as much as 4 pts in F1, while being much faster.
• Score: 36.439047786561396
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A recent state-of-the-art neural open information extraction (OpenIE) system generates extractions iteratively, requiring repeated encoding of partial outputs. This comes at a significant computational cost. On the other hand, sequence labeling approaches for OpenIE are much faster, but worse in extraction quality. In this paper, we bridge this trade-off by presenting an iterative labeling-based system that establishes a new state of the art for OpenIE, while extracting 10x faster. This is achieved through a novel Iterative Grid Labeling (IGL) architecture, which treats OpenIE as a 2-D grid labeling task. We improve its performance further by applying coverage (soft) constraints on the grid at training time. Moreover, on observing that the best OpenIE systems falter at handling coordination structures, our OpenIE system also incorporates a new coordination analyzer built with the same IGL architecture. This IGL based coordination analyzer helps our OpenIE system handle complicated coordination structures, while also establishing a new state of the art on the task of coordination analysis, with a 12.3 pts improvement in F1 over previous analyzers. Our OpenIE system, OpenIE6, beats the previous systems by as much as 4 pts in F1, while being much faster.

Related papers

• OTOv3: Automatic Architecture-Agnostic Neural Network Training and Compression from Structured Pruning to Erasing Operators [57.145175475579315]
  This topic spans various techniques, from structured pruning to neural architecture search, encompassing both pruning and erasing operators perspectives. We introduce the third-generation Only-Train-Once (OTOv3), which first automatically trains and compresses a general DNN through pruning and erasing operations. Our empirical results demonstrate the efficacy of OTOv3 across various benchmarks in structured pruning and neural architecture search.
  arXiv  Detail & Related papers  (2023-12-15T00:22:55Z)
• LOKE: Linked Open Knowledge Extraction for Automated Knowledge Graph Construction [0.0]
  We investigate the use of GPT models and prompt engineering for knowledge graph construction with the Wikidata knowledge graph. We show that a well engineered prompt, paired with a naive entity linking approach (which we call LOKE-GPT) outperforms AllenAI's OpenIE 4 implementation on the OKE task.
  arXiv  Detail & Related papers  (2023-11-15T20:57:44Z)
• LasUIE: Unifying Information Extraction with Latent Adaptive Structure-aware Generative Language Model [96.889634747943]
  Universally modeling all typical information extraction tasks (UIE) with one generative language model (GLM) has revealed great potential. We propose a novel structure-aware GLM, fully unleashing the power of syntactic knowledge for UIE. Over 12 IE benchmarks across 7 tasks our system shows significant improvements over the baseline UIE system.
  arXiv  Detail & Related papers  (2023-04-13T04:01:14Z)
• Towards Generalized Open Information Extraction [74.20080376460947]
  We propose a more realistic scenario: generalizing over unseen target domains with different data distributions from the source training domains. DragonIE beats the previous methods in both in-domain and out-of-domain settings by as much as 6.4% in F1 score absolutely.
  arXiv  Detail & Related papers  (2022-11-29T07:33:44Z)
• MORE: A Metric Learning Based Framework for Open-domain Relation Extraction [25.149590577718996]
  Open relation extraction (OpenRE) is the task of extracting relation schemes from open-domain corpora. We propose a novel learning framework named MORE (Metric learning-based Open Relation Extraction)
  arXiv  Detail & Related papers  (2022-06-01T07:51:20Z)
• Automatic Relation-aware Graph Network Proliferation [182.30735195376792]
  We propose Automatic Relation-aware Graph Network Proliferation (ARGNP) for efficiently searching GNNs. These operations can extract hierarchical node/relational information and provide anisotropic guidance for message passing on a graph. Experiments on six datasets for four graph learning tasks demonstrate that GNNs produced by our method are superior to the current state-of-the-art hand-crafted and search-based GNNs.
  arXiv  Detail & Related papers  (2022-05-31T10:38:04Z)
• Fast Community Detection based on Graph Autoencoder Reconstruction [0.4129225533930965]
  We propose a community detection framework based on Graph AutoEncoder Reconstruction (noted as GAER) We decompose the graph autoencoder-based one-step encoding into the two-stage encoding framework to adapt to the real-world big data system. We further propose a peer awareness based module for real-time large graphs, which can realize the new nodes community detection at a faster speed.
  arXiv  Detail & Related papers  (2022-03-07T06:04:27Z)
• Retrieving and Reading: A Comprehensive Survey on Open-domain Question Answering [62.88322725956294]
  We review the latest research trends in OpenQA, with particular attention to systems that incorporate neural MRC techniques. We introduce modern OpenQA architecture named Retriever-Reader'' and analyze the various systems that follow this architecture. We then discuss key challenges to developing OpenQA systems and offer an analysis of benchmarks that are commonly used.
  arXiv  Detail & Related papers  (2021-01-04T04:47:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.