Ranking-Based Automatic Seed Selection and Noise Reduction for Weakly Supervised Relation Extraction (P18-2)
Copied to clipboard
| Challenge: | et al., 1998: bootstrapping for relation extraction uses minimally supervised methods . etudes show that proposed methods for automatic seed selection and noise reduction are better than baseline systems . |
| Approach: | They propose automatic seed selection and noise reduction for distantly supervised relation extraction tasks. |
| Outcome: | The proposed methods achieve better performance than baseline systems in both tasks. |
Similar Papers
Seed Word Selection for Weakly-Supervised Text Classification with Unsupervised Error Estimation (2021.naacl-srw)
Copied to clipboard
| Challenge: | Weakly-supervised text classification aims to induce text classifiers from only a handful of user-provided seed words. |
| Approach: | They propose to use user-provided seed words to induce text classifiers using only a handful of carefully chosen seed words. |
| Outcome: | The proposed method outperforms baseline model using only category name seed words and achieves comparable performance as a counterpart using expert-annotated seed words. |
DIAG-NRE: A Neural Pattern Diagnosis Framework for Distantly Supervised Neural Relation Extraction (P19-1)
Copied to clipboard
| Challenge: | Existing methods for labeling relational facts require significant expert labor to write relation-specific patterns, which makes them too sophisticated to generalize quickly. |
| Approach: | They propose a neural pattern diagnosis framework that can summarize and refine relation-specific patterns with human experts in the loop. |
| Outcome: | The proposed framework can summarize and refine high-quality relational patterns from noise data with human experts in the loop. |
Learning from Noisy Labels for Entity-Centric Information Extraction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent information extraction approaches can easily overfit noisy labels and suffer from performance degradation. |
| Approach: | They propose a co-regularization framework for entity-centric information extraction that optimizes neural models with task-specific losses and regularizes them to generate similar predictions based on agreement loss. |
| Outcome: | The proposed framework is optimized with task-specific losses and generates similar predictions based on agreement loss. |
Debiasing Made State-of-the-art: Revisiting the Simple Seed-based Weak Supervision for Text Classification (2023.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in weakly supervised text classification focus on designing sophisticated methods to turn high-level human heuristics into quality pseudo-labels. |
| Approach: | They propose to use a seed matching-based method to generate quality pseudo-labels by deleting the seed words present in the matched input text. |
| Outcome: | The proposed method can be improved significantly by deleting the seed words in the matched input text with a high deletion ratio. |
Towards Realistic Low-resource Relation Extraction: A Benchmark with Empirical Baseline Study (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to extract relational facts from text are limited in their ability to learn from limited labeled data. |
| Approach: | They propose to use prompt-based methods with few-shot labeled data to evaluate performance . data augmentation technologies and self-training are also proposed to generate more labeles in-domain data. |
| Outcome: | The proposed methods perform well in low-resource settings with 8 relation extraction datasets. |
Extracting Entities and Relations with Joint Minimum Risk Training (D18-1)
Copied to clipboard
| Challenge: | Existing methods for detecting entities and relations are limited by the complexity of the joint learning paradigm. |
| Approach: | They propose a joint learning paradigm based on minimum risk training . they implement a strong and simple neural network to execute the MRT . |
| Outcome: | The proposed model is able to achieve state-of-the-art in the extraction task on ACE05 and NYT datasets. |
Unsupervised Information Extraction: Regularizing Discriminative Approaches with Relation Distribution Losses (P19-1)
Copied to clipboard
| Challenge: | Existing unsupervised relation extraction models are either generative or discriminative . however, they are hard to train without supervision and are unstable . |
| Approach: | They propose a skewness loss and distribution distance loss to improve the performance of discriminative based models. |
| Outcome: | The proposed models surpass current state-of-the-art on three different datasets. |
Neural Relation Extraction via Inner-Sentence Noise Reduction and Transfer Learning (D18-1)
Copied to clipboard
| Challenge: | Existing methods for extracting relations are slow and lack precision . a novel approach to extract relations is proposed to reduce noise between sentences . |
| Approach: | They propose a word-level distant supervised approach for relation extraction using New York Times and Freebase. |
| Outcome: | The proposed method improves the area of precision/call(PR) from 0.35 to 0.39 over the state-of-the-art methods. |
ToHRE: A Top-Down Classification Strategy with Hierarchical Bag Representation for Distantly Supervised Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods to find relational facts from texts lack hierarchical information of relations. |
| Approach: | They propose a hierarchical classification framework which extracts relation in a top-down manner. |
| Outcome: | The proposed method significantly outperforms state-of-the-art methods on NYT dataset . the proposed method generates large amounts of training data by aligning KBs with unlabeled corpora . |
CETA: A Consensus Enhanced Training Approach for Denoising in Distantly Supervised Relation Extraction (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for relation extraction use noisy instances and poor quality training data. |
| Approach: | They propose a sentence-level DSRE method that denies noisy samples from the wrong classification space on the feature space by enhancing the classification consensus between two discrepant classifiers. |
| Outcome: | The proposed method outperforms existing methods on widely-used benchmarks and significantly outperformed existing methods. |