CorefDRE: Document-level Relation Extraction with coreference resolution

• URL: http://arxiv.org/abs/2202.10744v1
• Date: Tue, 22 Feb 2022 09:03:59 GMT
• Title: CorefDRE: Document-level Relation Extraction with coreference resolution
• Authors: Zhongxuan Xue, Rongzhen Li, Qizhu Dai, Zhong Jiang
• Abstract summary: We use mention-pronoun coreference information to represent multi-sentence features by pronouns. A mention-pronoun coreference resolution is introduced to calculate the affinity between pronouns and corresponding mentions. Experiments on the public dataset, DocRED, DialogRE and MPDD, show that Coref-aware Doc-level Relation Extraction based on Graph Inference Network outperforms the state-of-the-art.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Document-level relation extraction is to extract relation facts from a document consisting of multiple sentences, in which pronoun crossed sentences are a ubiquitous phenomenon against a single sentence. However, most of the previous works focus more on mentions coreference resolution except for pronouns, and rarely pay attention to mention-pronoun coreference and capturing the relations. To represent multi-sentence features by pronouns, we imitate the reading process of humans by leveraging coreference information when dynamically constructing a heterogeneous graph to enhance semantic information. Since the pronoun is notoriously ambiguous in the graph, a mention-pronoun coreference resolution is introduced to calculate the affinity between pronouns and corresponding mentions, and the noise suppression mechanism is proposed to reduce the noise caused by pronouns. Experiments on the public dataset, DocRED, DialogRE and MPDD, show that Coref-aware Doc-level Relation Extraction based on Graph Inference Network outperforms the state-of-the-art.

Related papers

• Conversational Semantic Parsing using Dynamic Context Graphs [68.72121830563906]
  We consider the task of conversational semantic parsing over general purpose knowledge graphs (KGs) with millions of entities, and thousands of relation-types. We focus on models which are capable of interactively mapping user utterances into executable logical forms.
  arXiv  Detail & Related papers  (2023-05-04T16:04:41Z)
• Relational Sentence Embedding for Flexible Semantic Matching [86.21393054423355]
  We present Sentence Embedding (RSE), a new paradigm to discover further the potential of sentence embeddings. RSE is effective and flexible in modeling sentence relations and outperforms a series of state-of-the-art embedding methods.
  arXiv  Detail & Related papers  (2022-12-17T05:25:17Z)
• FactGraph: Evaluating Factuality in Summarization with Semantic Graph Representations [114.94628499698096]
  We propose FactGraph, a method that decomposes the document and the summary into structured meaning representations (MRs) MRs describe core semantic concepts and their relations, aggregating the main content in both document and summary in a canonical form, and reducing data sparsity. Experiments on different benchmarks for evaluating factuality show that FactGraph outperforms previous approaches by up to 15%.
  arXiv  Detail & Related papers  (2022-04-13T16:45:33Z)
• Pruned Graph Neural Network for Short Story Ordering [0.7087237546722617]
  Organizing sentences into an order that maximizes coherence is known as sentence ordering. We propose a new method for constructing sentence-entity graphs of short stories to create the edges between sentences. We also observe that replacing pronouns with their referring entities effectively encodes sentences in sentence-entity graphs.
  arXiv  Detail & Related papers  (2022-03-13T22:25:17Z)
• Keyphrase Extraction Using Neighborhood Knowledge Based on Word Embeddings [17.198907789163123]
  We enhance the graph-based ranking model by leveraging word embeddings as background knowledge to add semantic information to the inter-word graph. Our approach is evaluated on established benchmark datasets and empirical results show that the word embedding neighborhood information improves the model performance.
  arXiv  Detail & Related papers  (2021-11-13T21:48:18Z)
• Multiplex Graph Neural Network for Extractive Text Summarization [34.185093491514394]
  Extractive text summarization aims at extracting the most representative sentences from a given document as its summary. We propose a novel Multiplex Graph Convolutional Network (Multi-GCN) to jointly model different types of relationships among sentences and words. Based on Multi-GCN, we propose a Multiplex Graph Summarization (Multi-GraS) model for extractive text summarization.
  arXiv  Detail & Related papers  (2021-08-29T16:11:01Z)
• Mention-centered Graph Neural Network for Document-level Relation Extraction [2.724649366608364]
  We build cross-sentence dependencies by inferring compositional relations between inter-sentence mentions. Experiments show the connections between different mentions are crucial to document-level relation extraction.
  arXiv  Detail & Related papers  (2021-03-15T08:19:44Z)
• R$^2$-Net: Relation of Relation Learning Network for Sentence Semantic Matching [58.72111690643359]
  We propose a Relation of Relation Learning Network (R2-Net) for sentence semantic matching. We first employ BERT to encode the input sentences from a global perspective. Then a CNN-based encoder is designed to capture keywords and phrase information from a local perspective. To fully leverage labels for better relation information extraction, we introduce a self-supervised relation of relation classification task.
  arXiv  Detail & Related papers  (2020-12-16T13:11:30Z)
• Text Information Aggregation with Centrality Attention [86.91922440508576]
  We propose a new way of obtaining aggregation weights, called eigen-centrality self-attention. We build a fully-connected graph for all the words in a sentence, then compute the eigen-centrality as the attention score of each word.
  arXiv  Detail & Related papers  (2020-11-16T13:08:48Z)
• Understanding Points of Correspondence between Sentences for Abstractive Summarization [39.7404761923196]
  We present an investigation into fusing sentences drawn from a document by introducing the notion of points of correspondence. We create a dataset containing the documents, source and fusion sentences, and human annotations of points of correspondence between sentences.
  arXiv  Detail & Related papers  (2020-06-10T02:42:38Z)
• Heterogeneous Graph Neural Networks for Extractive Document Summarization [101.17980994606836]
  Cross-sentence relations are a crucial step in extractive document summarization. We present a graph-based neural network for extractive summarization (HeterSumGraph) We introduce different types of nodes into graph-based neural networks for extractive document summarization.
  arXiv  Detail & Related papers  (2020-04-26T14:38:11Z)

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.