Incorporating Global Contexts into Sentence Embedding for Relational Extraction at the Paragraph Level with Distant Supervision (L18-1)
Copied to clipboard
| Challenge: | Existing approaches to relation extraction (RE) only extract relations from sentences that contain two target entities. |
| Approach: | They propose to incorporate global contexts from paragraph-into-sentence embedding into RE . they propose to use a knowledge base to extract relations between pairs of entities . |
| Outcome: | The proposed approach can learn an exact RE from sentences without syntactic parsing. |
Similar Papers
Global Relation Embedding for Relation Extraction (N18-1)
Copied to clipboard
| Challenge: | Existing methods to extract textual relations with distant supervision are limited by their reliance on supervised training data. |
| Approach: | They propose to embed relations with global statistics of relations to combat the wrong labeling problem of distant supervision. |
| Outcome: | The proposed method is more robust to training noise introduced by distant supervision and improves relation extraction models. |
Global Textual Relation Embedding for Relational Understanding (P19-1)
Copied to clipboard
| Challenge: | Existing methods to learn textual relation embeddings are lacking in large open-domain corpora. |
| Approach: | They propose to learn a general-purpose embedding of textual relations using a large dataset from Freebase. |
| Outcome: | The proposed embedding can facilitate downstream tasks requiring relational understanding of the text. |
Entity or Relation Embeddings? An Analysis of Encoding Strategies for Relation Extraction (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to relation extraction use concatenating embeddings of head and tail entities . however, such representations capture the types of the entities involved, leading to false positives and confusion between relations involving entities of the same type. |
| Approach: | They propose a model which combines [MASK] embeddings with entity embedds to learn relation embeddations. |
| Outcome: | The proposed model outperforms the state-of-the-art on several benchmarks . it uses a self-supervised pre-training strategy which further improves the results. |
Label-Free Distant Supervision for Relation Extraction via Knowledge Graph Embedding (D18-1)
Copied to clipboard
| Challenge: | Existing methods to generate large scale labeled data for relation extraction produce noisy relation labels when there are multiple relationships between entities. |
| Approach: | They propose a method which assumes that a pair of entities appears in a Knowledge Graph and trains a relation classifier. |
| Outcome: | The proposed method performs well in the current distant supervision dataset. |
A Dataset for Inter-Sentence Relation Extraction using Distant Supervision (L18-1)
Copied to clipboard
| Challenge: | Existing methods for intra-sentence relation extraction use a distance supervision method to extract relations between entities. |
| Approach: | They propose a benchmark dataset for the task of inter-sentence relation extraction using relations previously used for intra-sentent relation extraction. |
| Outcome: | The proposed dataset is compared with baseline models and recurrent neural network models on the developed dataset. |
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. |
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. |
Combining Distant and Direct Supervision for Neural Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Existing methods to train relation extraction with distant supervision use noisy labels and implicitly assumes that all the KB facts are mentioned in the text. |
| Approach: | They propose to combine distant supervision data with additional directly-supervised data to train relation extraction models by using sigmoidal attention weights with max pooling. |
| Outcome: | The proposed method achieves state-of-the-art on the widely used FB-NYT dataset. |
Distantly Supervised Relation Extraction in Federated Settings (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to label training datasets using distant supervision are expensive and cannot cover all walks of life. |
| Approach: | They propose a federated denoising framework to suppress label noise in federation . they propose to use a multiple instance learning based denoisation method to select reliable sentences . |
| Outcome: | The proposed method can select reliable sentences via cross-platform collaboration. |
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. |