REXEL: An End-to-end Model for Document-Level Relation Extraction and Entity Linking
Not on the map. Why?
Abstract (arXiv)
Extracting structured information from unstructured text is critical for many downstream NLP applications and is traditionally achieved by closed information extraction (cIE). However, existing approaches for cIE suffer from two limitations: (i) they are often pipelines which makes them prone to error propagation, and/or (ii) they are restricted to sentence level which prevents them from capturing long-range dependencies and results in expensive inference time. We address these limitations by proposing REXEL, a highly efficient and accurate model for the joint task of document level cIE (DocIE). REXEL performs mention detection, entity typing, entity disambiguation, coreference resolution and document-level relation classification in a single forward pass to yield facts fully linked to a reference knowledge graph. It is on average 11 times faster than competitive existing approaches in a similar setting and performs competitively both when optimised for any of the individual subtasks and a variety of combinations of different joint tasks, surpassing the baselines by an average of more than 6 F1 points. The combination of speed and accuracy makes REXEL an accurate cost-efficient system for extracting structured information at web-scale. We also release an extension of the DocRED dataset to enable benchmarking of future work on DocIE, which is available at https://github.com/amazon-science/e2e-docie.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 38 references that are in the map. First posted on arXiv 19 Apr 2024.
Builds on
21 of 38 references.
References · 21
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
- 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
- 2018Higher-order Coreference Resolution with Coarse-to-fine Inferencecited by 150
- 2020Double Graph Based Reasoning for Document-level Relation Extractioncited by 87
- 2021Document-level Relation Extraction as Semantic Segmentationcited by 80
- 2022ReFinED: An Efficient Zero-shot-capable Approach to End-to-End Entity Linkingcited by 74
- 2021Entity Structure Within and Throughout: Modeling Mention Dependencies for Document-Level Relation Extractioncited by 68
- 2022Revisiting DocRED -- Addressing the False Negative Problem in Relation Extractioncited by 57
- 2021GenIE: Generative Information Extractioncited by 53
9 more
- 2018Reinforcement Learning for Relation Classification from Noisy Datacited by 46
- 2020Global-to-Local Neural Networks for Document-Level Relation Extractioncited by 43
- 2018DeepType: Multilingual Entity Linking by Neural Type System Evolutioncited by 41
- 2021An End-to-end Model for Entity-level Relation Extraction using Multi-instance Learningcited by 31
- 2020DWIE: an entity-centric dataset for multi-task document-level information extractioncited by 29
- 2021Injecting Knowledge Base Information into End-to-End Joint Entity and Relation Extraction and Coreference Resolutioncited by 12
- 2021Robustness Evaluation of Entity Disambiguation Using Prior Probes:the Case of Entity Overshadowingcited by 11
- 2022Improving Entity Disambiguation by Reasoning over a Knowledge Basecited by 7
- 2021Separating Retention from Extraction in the Evaluation of End-to-end Relation Extractioncited by 2
Built on by
Citing papers per year: 2025: 2.
2 papers.