Three Sentences Are All You Need: Local Path Enhanced Document Relation Extraction
Quzhe Huang, Shengqi Zhu, Yansong Feng, Yuan Ye, Yuxuan Lai, Dongyan, Zhao

TL;DR
This paper introduces a simple heuristic method to select key evidence sentences for document-level relation extraction, achieving superior performance over complex graph neural network methods by combining it with BiLSTM.
Contribution
The paper proposes an effective and straightforward heuristic for evidence sentence selection in document RE, improving performance without complex models.
Findings
Outperforms graph neural network-based methods on benchmarks
Simple heuristic combined with BiLSTM yields high accuracy
Code released for reproducibility
Abstract
Document-level Relation Extraction (RE) is a more challenging task than sentence RE as it often requires reasoning over multiple sentences. Yet, human annotators usually use a small number of sentences to identify the relationship between a given entity pair. In this paper, we present an embarrassingly simple but effective method to heuristically select evidence sentences for document-level RE, which can be easily combined with BiLSTM to achieve good performance on benchmark datasets, even better than fancy graph neural network based methods. We have released our code at https://github.com/AndrewZhe/Three-Sentences-Are-All-You-Need.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Advanced Text Analysis Techniques
MethodsGraph Neural Network · Tanh Activation · Sigmoid Activation · Long Short-Term Memory · Bidirectional LSTM
