Lightweight Person-Place Relation Extraction from Historical Newspapers with Dependency Graphs and Proximity Features
Not on the map. Why?
Abstract (arXiv)
The HIPE-2026 shared task introduces person-place relation extraction from multilingual historical newspapers as a new evaluation track, classifying the at and isAt relations between pre-annotated person and location mentions in English, French, and German. Motivated by the cost of processing historical archives at scale, our team (DS@GT HIPE, team 2 in the official results) investigates how far a lightweight, interpretable system can go without any pretrained language model at the relation classification stage. Our approach builds a document-level graph from dependency parses, extracts proximity-based and part-of-speech features for each entity pair, and classifies them with small scikit-learn ensembles or compact Graph Attention Networks, keeping every submitted run under 847K parameters. On the official evaluation (Test A, the newspaper test set), our best run reached a macro recall of 0.5142, ranking 3rd on the Efficiency profile while placing mid-table on Accuracy among the 17 participating teams. Two findings stand out. First, minimum character distance alone captures most of the classification signal; adding further engineered features yields inconsistent gains and sometimes degrades performance, echoing prior evidence that argument distance dominates relation extraction. Second, document-grouped cross-validation is essential on this corpus: pair-level splits inflate scores by 25-37 percentage points because entity mentions recur across documents, a data-leakage effect that grouped cross-validation removes.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 34 references that are in the map. First posted on arXiv 22 Jul 2026.
Builds on
18 of 34 references.
References · 18
- 2017Graph Attention Networkscited by 8,923
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2016Enriching Word Vectors with Subword Informationcited by 1,583
- 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
- 2021How Attentive are Graph Attention Networks?cited by 835
- 2020Stanza: A Python Natural Language Processing Toolkit for Many Human Languagescited by 723
- 2019DocRED: A Large-Scale Document-Level Relation Extraction Datasetcited by 239
- 2018Graph Convolution over Pruned Dependency Trees Improves Relation Extractioncited by 146
- 2017Cross-Sentence N-ary Relation Extraction with Graph LSTMscited by 101
- 2020Reasoning with Latent Structure Refinement for Document-Level Relation Extractioncited by 97
- 2019Attention Guided Graph Convolutional Networks for Relation Extractioncited by 82
- 2020We Need to Talk About Random Splitscited by 71
6 more
- 2021Memorization vs. Generalization: Quantifying Data Leakage in NLP Performance Evaluationcited by 70
- 2021Named Entity Recognition and Classification on Historical Documents: A Surveycited by 47
- 2024A Closer Look at Classification Evaluation Metrics and a Critical Reflection of Common Evaluation Practicecited by 26
- 2020Probing Linguistic Features of Sentence-Level Representations in Neural Relation Extractioncited by 18
- 2026Overview of HIPE-2026: Person-Place Relation Extraction from Multilingual Historical Textscited by 2
- 2018LightRel SemEval-2018 Task 7: Lightweight and Fast Relation Classificationcited by 1
Built on by
Not cited yet.