SAIS: Supervising and Augmenting Intermediate Steps for Document-Level Relation Extraction (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for relation extraction only implicitly learn to model relevant contexts and entity types while being trained for RE. |
| Approach: | They propose to explicitly teach the model to capture relevant contexts and entity types by supervising and augmenting intermediate steps (SAIS) for RE. |
| Outcome: | The proposed method outperforms the runner-up method on three benchmarks by 5.04% . textual contexts and entity types are the major information sources that lead to the success of previous approaches. |
Similar Papers
Semi-automatic Data Enhancement for Document-Level Relation Extraction with Distant Supervision from Large Language Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Document-level Relation Extraction (DocRE) is a task that aims to extract relations from a long context. |
| Approach: | They propose an automated annotation method that integrates an LLM and a natural language inference module to generate relation triples. |
| Outcome: | The proposed method can extract relations from document-level relation datasets with minimal human effort. |
AutoRE: Document-Level Relation Extraction with Large Language Models (2024.acl-demos)
Copied to clipboard
| Challenge: | Existing methods for relation extraction are limited to Sentence-level Relation Extraction (SentRE) tasks. |
| Approach: | They propose an end-to-end DocRE model that adopts a novel RE extraction paradigm named RHF (Relation-Head-Facts) Unlike existing approaches, AutoRE does not rely on the assumption of known relation options, making it more reflective of real-world scenarios. |
| Outcome: | The proposed model surpasses TAG by 10.03% and 9.03% on the dev and test set. |
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. |
GDA: Generative Data Augmentation Techniques for Relation Extraction Tasks (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing work adopts data augmentation techniques to generate pseudo-annotated sentences . existing methods neither preserve semantic consistency of original sentences nor preserve syntax structure of sentences when expressing relations using seq2seq models, resulting in less diverse augmentations. |
| Approach: | They propose a dedicated augmentation technique for relational texts, named GDA, which uses two complementary modules to preserve both semantic consistency and syntax structures. |
| Outcome: | The proposed technique can bring 2.0% F1 improvements in three datasets under low-resource setting. |
Semi-supervised Relation Extraction via Data Augmentation and Consistency-training (2023.eacl-main)
Copied to clipboard
| Challenge: | Obtaining high-quality human labelled data is an expensive and noisy process. |
| Approach: | They propose to leverage unlabelled data to improve the sample efficiency of the models. |
| Outcome: | The proposed methods can be used to extract the Cause-Effect relation between a given head entity and tail entity based on context in the input sentence. |
Three Sentences Are All You Need: Local Path Enhanced Document Relation Extraction (2021.acl-short)
Copied to clipboard
| Challenge: | Document-level relation extraction (RE) is more challenging than sentence RE as it often requires reasoning over multiple sentences. |
| Approach: | They propose a method to heuristically select evidence sentences for document-level relation extraction. |
| Outcome: | The proposed method can be easily combined with BiLSTM to achieve good performance on benchmark datasets even better than fancy graph neural network based methods. |
Towards Better Document-level Relation Extraction via Iterative Inference (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods only consider feature information of entity pairs, but our model exploits both feature information and previous predictions of entity pair. |
| Approach: | They propose a document-level relation extraction model with iterative inference to extract relations between entities from raw texts. |
| Outcome: | The proposed model outperforms existing methods on three commonly-used datasets. |
SRF: Enhancing Document-Level Relation Extraction with a Novel Secondary Reasoning Framework (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for document-level relation extraction ignore bidirectional mention interaction when generating relational features for entity pairs. |
| Approach: | They propose a document-level relation extraction model that incorporates bidirectional mention fusion and a simple yet effective evidence extraction module for relation prediction. |
| Outcome: | The proposed model achieves SOTA performance and the proposed method is effective and general when integrated into existing models. |
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%. |
Relation Extraction using Explicit Context Conditioning (N19-1)
Copied to clipboard
| Challenge: | Existing methods for relation extraction fail to capture complex and long dependencies . end-to-end models that learn both NER and RE can solve this problem . |
| Approach: | They propose to use second-order relations to compute relation scores for relation extraction (RE) . they propose to combine second- and first-order relation scores to obtain final relation scores . |
| Outcome: | The proposed method leads to state-of-the-art performance over two biomedical datasets. |