An Overview of Distant Supervision for Relation Extraction with a Focus on Denoising and Pre-training Methods
Not on the map. Why?
Abstract (arXiv)
Relation Extraction (RE) is a foundational task of natural language processing. RE seeks to transform raw, unstructured text into structured knowledge by identifying relational information between entity pairs found in text. RE has numerous uses, such as knowledge graph completion, text summarization, question-answering, and search querying. The history of RE methods can be roughly organized into four phases: pattern-based RE, statistical-based RE, neural-based RE, and large language model-based RE. This survey begins with an overview of a few exemplary works in the earlier phases of RE, highlighting limitations and shortcomings to contextualize progress. Next, we review popular benchmarks and critically examine metrics used to assess RE performance. We then discuss distant supervision, a paradigm that has shaped the development of modern RE methods. Lastly, we review recent RE works focusing on denoising and pre-training methods.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 52 references that are in the map. First posted on arXiv 17 Jul 2022.
Builds on
29 of 52 references.
References · 29
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2019SciBERT: A Pretrained Language Model for Scientific Textcited by 1,404
- 2020Domain-Specific Language Model Pretraining for Biomedical Natural Language Processingcited by 996
- 2019Matching the Blanks: Distributional Similarity for Relation Learningcited by 271
- 2018FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluationcited by 254
- 2019DocRED: A Large-Scale Document-Level Relation Extraction Datasetcited by 239
- 2016End-to-End Relation Extraction using LSTMs on Sequences and Tree Structurescited by 161
- 2017Cross-Sentence N-ary Relation Extraction with Graph LSTMscited by 101
- 2019FewRel 2.0: Towards More Challenging Few-Shot Relation Classificationcited by 94
17 more
- 2020Learning from Context or Names? An Empirical Study on Neural Relation Extractioncited by 75
- 2020ERICA: Improving Entity and Relation Understanding for Pre-trained Language Models via Contrastive Learningcited by 72
- 2019SemEval-2010 Task 8: Multi-Way Classification of Semantic Relations Between Pairs of Nominalscited by 63
- 2016Distant Supervision for Relation Extraction beyond the Sentence Boundarycited by 62
- 2015Relation Classification via Recurrent Neural Networkcited by 46
- 2019Fine-tune Bert for DocRED with Two-step Processcited by 42
- 2020HIN: Hierarchical Inference Network for Document-Level Relation Extractioncited by 42
- 2016Question Answering on Freebase via Relation Extraction and Textual Evidencecited by 39
- 2019Fine-tuning Pre-Trained Transformer Language Models to Distantly Supervised Relation Extractioncited by 36
- 2020Denoising Relation Extraction from Document-level Distant Supervisioncited by 19
- 2019Self-Attention Enhanced Selective Gate with Entity-Aware Embedding for Distantly Supervised Relation Extractioncited by 18
- 2017Learning with Noise: Enhance Distantly Supervised Relation Extraction with Dynamic Transition Matrixcited by 14
- 2021Manual Evaluation Matters: Reviewing Test Protocols of Distantly Supervised Relation Extractioncited by 12
- 2020A Data-driven Approach for Noise Reduction in Distantly Supervised Biomedical Relation Extractioncited by 8
- 2021How Knowledge Graph and Attention Help? A Quantitative Analysis into Bag-level Relation Extractioncited by 8
- 2021Abstractified Multi-instance Learning (AMIL) for Biomedical Relation Extractioncited by 7
- 2022Fine-grained Contrastive Learning for Relation Extractioncited by 7
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.