An Improved Baseline for Sentence-level Relation Extraction
About
Sentence-level relation extraction (RE) aims at identifying the relationship between two entities in a sentence. Many efforts have been devoted to this problem, while the best performing methods are still far from perfect. In this paper, we revisit two problems that affect the performance of existing RE models, namely entity representation and noisy or ill-defined labels. Our improved RE baseline, incorporated with entity representations with typed markers, achieves an F1 of 74.6% on TACRED, significantly outperforms previous SOTA methods. Furthermore, the presented new baseline achieves an F1 of 91.1% on the refined Re-TACRED dataset, demonstrating that the pretrained language models (PLMs) achieve high performance on this task. We release our code to the community for future research.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Relation Extraction | TACRED (test) | F1 Score74.6 | 194 | |
| Relation Extraction | TACRED | Micro F175 | 97 | |
| Relation Extraction | SemEval (test) | Micro F189.8 | 55 | |
| Relation Extraction | TACRED v1.0 (test) | F1 Score91.1 | 37 | |
| Relation Extraction | Re-TACRED | -- | 35 | |
| Relation Extraction | TACRED Original (test) | F1 Score74.6 | 23 | |
| Relation Extraction | SCIERC (test) | F1 Score88.9 | 23 | |
| Relation Extraction | TACRED v1.0 (5% train) | Micro F10.636 | 19 | |
| Relation Extraction | TACRED v1.0 (full) | Micro F174.6 | 16 | |
| Relation Extraction | TACRED 1% v1.0 (train) | Micro F146.3 | 13 |