Coarse-to-Fine Entity Representations for Document-level Relation Extraction

• URL: http://arxiv.org/abs/2012.02507v1
• Date: Fri, 4 Dec 2020 10:18:59 GMT
• Title: Coarse-to-Fine Entity Representations for Document-level Relation Extraction
• Authors: Damai Dai, Jing Ren, Shuang Zeng, Baobao Chang, Zhifang Sui
• Abstract summary: Document-level Relation Extraction (RE) requires extracting relations expressed within and across sentences. Recent works show that graph-based methods, usually constructing a document-level graph that captures document-aware interactions, can obtain useful entity representations. We propose the textbfCoarse-to-textbfFine textbfEntity textbfRepresentation model (textbfCFER) that adopts a coarse-to-fine strategy.
• Score: 28.39444850200523
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Document-level Relation Extraction (RE) requires extracting relations expressed within and across sentences. Recent works show that graph-based methods, usually constructing a document-level graph that captures document-aware interactions, can obtain useful entity representations thus helping tackle document-level RE. These methods either focus more on the entire graph, or pay more attention to a part of the graph, e.g., paths between the target entity pair. However, we find that document-level RE may benefit from focusing on both of them simultaneously. Therefore, to obtain more comprehensive entity representations, we propose the \textbf{C}oarse-to-\textbf{F}ine \textbf{E}ntity \textbf{R}epresentation model (\textbf{CFER}) that adopts a coarse-to-fine strategy involving two phases. First, CFER uses graph neural networks to integrate global information in the entire graph at a coarse level. Next, CFER utilizes the global information as a guidance to selectively aggregate path information between the target entity pair at a fine level. In classification, we combine the entity representations from both two levels into more comprehensive representations for relation extraction. Experimental results on a large-scale document-level RE dataset show that CFER achieves better performance than previous baseline models. Further, we verify the effectiveness of our strategy through elaborate model analysis.

Related papers

• Hypergraph based Understanding for Document Semantic Entity Recognition [65.84258776834524]
  We build a novel hypergraph attention document semantic entity recognition framework, HGA, which uses hypergraph attention to focus on entity boundaries and entity categories at the same time. Our results on FUNSD, CORD, XFUNDIE show that our method can effectively improve the performance of semantic entity recognition tasks.
  arXiv  Detail & Related papers  (2024-07-09T14:35:49Z)
• 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)
• Document-level Relation Extraction with Cross-sentence Reasoning Graph [14.106582119686635]
  Relation extraction (RE) has recently moved from the sentence-level to document-level. We propose a novel document-level RE model with a GRaph information Aggregation and Cross-sentence Reasoning network (GRACR) Experimental results show GRACR achieves excellent performance on two public datasets of document-level RE.
  arXiv  Detail & Related papers  (2023-03-07T14:14:12Z)
• ReSel: N-ary Relation Extraction from Scientific Text and Tables by Learning to Retrieve and Select [53.071352033539526]
  We study the problem of extracting N-ary relations from scientific articles. Our proposed method ReSel decomposes this task into a two-stage procedure. Our experiments on three scientific information extraction datasets show that ReSel outperforms state-of-the-art baselines significantly.
  arXiv  Detail & Related papers  (2022-10-26T02:28:02Z)
• 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)
• Long Document Summarization with Top-down and Bottom-up Inference [113.29319668246407]
  We propose a principled inference framework to improve summarization models on two aspects. Our framework assumes a hierarchical latent structure of a document where the top-level captures the long range dependency. We demonstrate the effectiveness of the proposed framework on a diverse set of summarization datasets.
  arXiv  Detail & Related papers  (2022-03-15T01:24:51Z)
• A Hierarchical Entity Graph Convolutional Network for Relation Extraction across Documents [29.183245395412705]
  We propose cross-document relation extraction, where the two entities of a relation appear in two different documents. Following this idea, we create a dataset for two-hop relation extraction, where each chain contains exactly two documents. Our proposed dataset covers a higher number of relations than the publicly available sentence-level datasets.
  arXiv  Detail & Related papers  (2021-08-21T12:33:50Z)
• Document-level Relation Extraction as Semantic Segmentation [38.614931876015625]
  Document-level relation extraction aims to extract relations among multiple entity pairs from a document. This paper approaches the problem by predicting an entity-level relation matrix to capture local and global information. We propose a Document U-shaped Network for document-level relation extraction.
  arXiv  Detail & Related papers  (2021-06-07T13:44:44Z)
• BASS: Boosting Abstractive Summarization with Unified Semantic Graph [49.48925904426591]
  BASS is a framework for Boosting Abstractive Summarization based on a unified Semantic graph. A graph-based encoder-decoder model is proposed to improve both the document representation and summary generation process. Empirical results show that the proposed architecture brings substantial improvements for both long-document and multi-document summarization tasks.
  arXiv  Detail & Related papers  (2021-05-25T16:20:48Z)
• Double Graph Based Reasoning for Document-level Relation Extraction [29.19714611415326]
  Document-level relation extraction aims to extract relations among entities within a document. We propose Graph Aggregation-and-Inference Network (GAIN) featuring double graphs. Experiments on the public dataset, DocRED, show GAIN achieves a significant performance improvement (2.85 on F1) over the previous state-of-the-art.
  arXiv  Detail & Related papers  (2020-09-29T03:41:01Z)
• Leveraging Graph to Improve Abstractive Multi-Document Summarization [50.62418656177642]
  We develop a neural abstractive multi-document summarization (MDS) model which can leverage well-known graph representations of documents. Our model utilizes graphs to encode documents in order to capture cross-document relations, which is crucial to summarizing long documents. Our model can also take advantage of graphs to guide the summary generation process, which is beneficial for generating coherent and concise summaries.
  arXiv  Detail & Related papers  (2020-05-20T13:39:47Z)

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.