Document-Level N-ary Relation Extraction with Multiscale Representation Learning (N19-1)
Copied to clipboard
| Challenge: | Existing work on cross-sentence relation extraction is limited to three consecutive sentences, which severely limits recall. |
| Approach: | They propose a multiscale neural architecture for document-level n-ary relation extraction that combines representations learned over various text spans throughout the document and across the subrelation hierarchy. |
| Outcome: | The proposed system outperforms existing methods on biomedical machine reading. |
Similar Papers
Modular Self-Supervision for Document-Level Relation Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Prior work on information extraction tends to focus on binary relations within sentences . practical applications often require extracting complex relations across large text spans . |
| Approach: | They propose to decompose document-level relation extraction into relation detection and argument resolution, taking inspiration from Davidsonian semantics. |
| Outcome: | The proposed method outperforms state-of-the-art methods in biomedical machine reading for precision oncology by 20 absolute F1 points. |
Global-to-Local Neural Networks for Document-Level Relation Extraction (2020.emnlp-main)
Copied to clipboard
| Challenge: | Relation extraction (RE) aims to identify the semantic relations between named entities in text. |
| Approach: | They propose a novel relation extraction model that encodes document information in terms of entity global and local representations and context relation representations. |
| Outcome: | The proposed model achieves superior performance on two public datasets for document-level RE. |
N-ary Relation Extraction using Graph-State LSTM (D18-1)
Copied to clipboard
| Challenge: | Existing methods for cross-sentence relation extraction split the input graph into two DAGs, but important information can be lost in the splitting procedure. |
| Approach: | They propose a graph-state LSTM model which uses a parallel state to model each word, recurrently enriching state values via message passing. |
| Outcome: | The proposed model keeps the original graph structure, and speeds up computation by allowing more parallelization. |
Cross-Sentence N-ary Relation Extraction using Lower-Arity Universal Schemas (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to extract n-ary relations from text are limited to binary relations. |
| Approach: | They propose to learn relation representations of lower-arity facts from decomposing higher-arities . they conduct experiments with datasets for ternary relation extraction . |
| Outcome: | The proposed method improves the performance of n-ary relation extraction methods compared to previous methods. |
Connecting the Dots: Document-level Neural Relation Extraction with Edge-oriented Graphs (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to document-level relation extraction use nodes and edges as relations between nodes. |
| Approach: | They propose an edge-oriented graph neural model for document-level relation extraction that uses different types of nodes and edges to create a document-based graph. |
| Outcome: | The proposed model can learn intra- and inter-sentence relations using multi-instance learning internally. |
TTM-RE: Memory-Augmented Document-Level Relation Extraction (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for document-level relation extraction are ineffective in exploiting the full potential of large amounts of training data with varied noise levels. |
| Approach: | They propose a novel approach that integrates a trainable memory module with a noisy-robust loss function that accounts for the positive-unlabeled setting to unlock the full potential of large-scale noisy training data. |
| Outcome: | The proposed model outperforms existing methods on a ReDocRED benchmark dataset with an absolute F1 score improvement of over 3%. |
Structured Minimally Supervised Learning for Neural Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Recent work shows that distant supervision can cause significant label noise when learning from large quantities of unlabeled text. |
| Approach: | They propose a method that combines the benefits of learning representations and structured learning to predict sentence-level relation mentions given only proposition-level supervision from a KB. |
| Outcome: | The proposed approach outperforms a number of baseline approaches while minimizing label noise. |
Modeling Multi-Granularity Hierarchical Features for Relation Extraction (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing work on relation extraction focuses on constructing explicit structured features using knowledge graph and dependency tree. |
| Approach: | They propose a method to extract multi-granularity features based solely on the original input sentences. |
| Outcome: | The proposed method outperforms state-of-the-art models that even use external knowledge on three public benchmarks: SemEval 2010 Task 8, Tacred, and Tacred Revisited. |
Document-Level Relation Extraction via Pair-Aware and Entity-Enhanced Representation Learning (2022.coling-1)
Copied to clipboard
| Challenge: | Existing document-level relation extraction methods are sparse in relational entity pairs and the representation of entity pairs is insufficient. |
| Approach: | They propose a Pair-Aware and Entity-Enhanced(PAEE) model to solve two challenges . they propose predicting potential relational entity pairs and assembling directional entity pairs . |
| Outcome: | The proposed model can obtain state-of-the-art performance on four benchmark datasets . it can predict potential relational entity pairs and assemble directional entity pairs . |
An End-to-end Model for Entity-level Relation Extraction using Multi-instance Learning (2021.eacl-main)
Copied to clipboard
| Challenge: | Using a multi-task approach, we extract facts from documents at entity level. |
| Approach: | They propose a multi-task approach that builds upon coreference resolution and gathers relevant signals via multi-instance learning with multi-level representations combining global entity and local mention information. |
| Outcome: | The proposed model is on par with task-specific learning, though more efficient due to shared parameters and training steps. |