Document-level Relation Extraction with Context Guided Mention Integration and Inter-pair Reasoning

• URL: http://arxiv.org/abs/2201.04826v1
• Date: Thu, 13 Jan 2022 08:00:23 GMT
• Title: Document-level Relation Extraction with Context Guided Mention Integration and Inter-pair Reasoning
• Authors: Chao Zhao, Daojian Zeng, Lu Xu, Jianhua Dai
• Abstract summary: Document-level Relation Extraction (DRE) aims to recognize the relations between two entities. Few previous studies have investigated the mention integration, which may be problematic. We propose two novel techniques, Context Guided Mention Integration and Inter-pair Reasoning.
• Score: 18.374097786748834
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Document-level Relation Extraction (DRE) aims to recognize the relations between two entities. The entity may correspond to multiple mentions that span beyond sentence boundary. Few previous studies have investigated the mention integration, which may be problematic because coreferential mentions do not equally contribute to a specific relation. Moreover, prior efforts mainly focus on reasoning at entity-level rather than capturing the global interactions between entity pairs. In this paper, we propose two novel techniques, Context Guided Mention Integration and Inter-pair Reasoning (CGM2IR), to improve the DRE. Instead of simply applying average pooling, the contexts are utilized to guide the integration of coreferential mentions in a weighted sum manner. Additionally, inter-pair reasoning executes an iterative algorithm on the entity pair graph, so as to model the interdependency of relations. We evaluate our CGM2IR model on three widely used benchmark datasets, namely DocRED, CDR, and GDA. Experimental results show that our model outperforms previous state-of-the-art models.

Related papers

• A Semantic Mention Graph Augmented Model for Document-Level Event Argument Extraction [12.286432133599355]
  Document-level Event Argument Extraction (DEAE) aims to identify arguments and their specific roles from an unstructured document. advanced approaches on DEAE utilize prompt-based methods to guide pre-trained language models (PLMs) in extracting arguments from input documents. We propose a semantic mention Graph Augmented Model (GAM) to address these two problems in this paper.
  arXiv  Detail & Related papers  (2024-03-12T08:58:07Z)
• Coherent Entity Disambiguation via Modeling Topic and Categorical Dependency [87.16283281290053]
  Previous entity disambiguation (ED) methods adopt a discriminative paradigm, where prediction is made based on matching scores between mention context and candidate entities. We propose CoherentED, an ED system equipped with novel designs aimed at enhancing the coherence of entity predictions. We achieve new state-of-the-art results on popular ED benchmarks, with an average improvement of 1.3 F1 points.
  arXiv  Detail & Related papers  (2023-11-06T16:40:13Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• Document-level Relation Extraction with Relation Correlations [15.997345900917058]
  Document-level relation extraction faces two overlooked challenges: long-tail problem and multi-label problem. We analyze the co-occurrence correlation of relations, and introduce it into DocRE task for the first time.
  arXiv  Detail & Related papers  (2022-12-20T11:17:52Z)
• Modeling Task Interactions in Document-Level Joint Entity and Relation Extraction [20.548299226366193]
  Graph Compatibility (GC) is designed to leverage task characteristics, bridging decisions of two tasks for direct task interference. GC achieves the best performance by up to 2.3/5.1 F1 improvement over the baseline.
  arXiv  Detail & Related papers  (2022-05-04T06:18:28Z)
• Document-Level Relation Extraction with Sentences Importance Estimation and Focusing [52.069206266557266]
  Document-level relation extraction (DocRE) aims to determine the relation between two entities from a document of multiple sentences. We propose a Sentence Estimation and Focusing (SIEF) framework for DocRE, where we design a sentence importance score and a sentence focusing loss. Experimental results on two domains show that our SIEF not only improves overall performance, but also makes DocRE models more robust.
  arXiv  Detail & Related papers  (2022-04-27T03:20:07Z)
• SAIS: Supervising and Augmenting Intermediate Steps for Document-Level Relation Extraction [51.27558374091491]
  We propose to explicitly teach the model to capture relevant contexts and entity types by supervising and augmenting intermediate steps (SAIS) for relation extraction. Based on a broad spectrum of carefully designed tasks, our proposed SAIS method not only extracts relations of better quality due to more effective supervision, but also retrieves the corresponding supporting evidence more accurately.
  arXiv  Detail & Related papers  (2021-09-24T17:37:35Z)
• Learning to Decouple Relations: Few-Shot Relation Classification with Entity-Guided Attention and Confusion-Aware Training [49.9995628166064]
  We propose CTEG, a model equipped with two mechanisms to learn to decouple easily-confused relations. On the one hand, an EGA mechanism is introduced to guide the attention to filter out information causing confusion. On the other hand, a Confusion-Aware Training (CAT) method is proposed to explicitly learn to distinguish relations.
  arXiv  Detail & Related papers  (2020-10-21T11:07:53Z)
• Relation of the Relations: A New Paradigm of the Relation Extraction Problem [52.21210549224131]
  We propose a new paradigm of Relation Extraction (RE) that considers as a whole the predictions of all relations in the same context. We develop a data-driven approach that does not require hand-crafted rules but learns by itself the relation of relations (RoR) using Graph Neural Networks and a relation matrix transformer. Experiments show that our model outperforms the state-of-the-art approaches by +1.12% on the ACE05 dataset and +2.55% on SemEval 2018 Task 7.2.
  arXiv  Detail & Related papers  (2020-06-05T22:25:27Z)
• Reasoning with Latent Structure Refinement for Document-Level Relation Extraction [20.308845516900426]
  We propose a novel model that empowers the relational reasoning across sentences by automatically inducing the latent document-level graph. Specifically, our model achieves an F1 score of 59.05 on a large-scale document-level dataset (DocRED)
  arXiv  Detail & Related papers  (2020-05-13T13:36:09Z)

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.