In plain words: Instead of a word-by-word network trained from scratch, this system reads documents with a language model pre-trained on lots of text, then answers in two passes: first whether two entities are related, then which relation. It beats the usual baseline on the document relation task.
Abstract · Fine-tune Bert for DocRED with Two-step Process
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.
Hong Wang, Christfried Focke, Rob Sylvester, Nilesh Mishra, William Wang
arXiv:1909.11898 · cs.CL · submitted Sep 26, 2019
abstract · pdf · html