Fine-tune Bert for DocRED with Two-step Process
arXiv:1909.11898
Abstract
Modelling relations between multiple entities has attracted increasing attention recently, and a new dataset called DocRED has been collected in order to accelerate the research on the document-level relation extraction. Current baselines for this task uses BiLSTM to encode the whole document and are trained from scratch. We argue that such simple baselines are not strong enough to model to complex interaction between entities. In this paper, we further apply a pre-trained language model (BERT) to provide a stronger baseline for this task. We also find that solving this task in phases can further improve the performance. The first step is to predict whether or not two entities have a relation, the second step is to predict the specific relation.
Cited by in corpus (16)
- Deep Neural Approaches to Relation Triplets Extraction: A Comprehensive Survey
- Reasoning with Latent Structure Refinement for Document-Level Relation Extraction
- Coreferential Reasoning Learning for Language Representation
- Double Graph Based Reasoning for Document-level Relation Extraction
- HIN: Hierarchical Inference Network for Document-Level Relation Extraction
- Entity Structure Within and Throughout: Modeling Mention Dependencies for Document-Level Relation Extraction
- SIRE: Separate Intra- and Inter-sentential Reasoning for Document-level Relation Extraction
- Entity and Evidence Guided Relation Extraction for DocRED
- Global-to-Local Neural Networks for Document-Level Relation Extraction
- Coarse-to-Fine Entity Representations for Document-level Relation Extraction
- Deep Neural Networks for Relation Extraction
- Denoising Relation Extraction from Document-level Distant Supervision
- Mention-centered Graph Neural Network for Document-level Relation Extraction
- Multi-view Inference for Relation Extraction with Uncertain Knowledge
- Learning Logic Rules for Document-level Relation Extraction
- From Bag of Sentences to Document: Distantly Supervised Relation Extraction via Machine Reading Comprehension