mlsanityData to 14 Oct 2026

Decoding the Past: Explainable Machine Learning Models for Dating Historical Texts

arXiv 2511.23056 ↗First posted 28 Nov 2025cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Accurately dating historical texts is essential for organizing and interpreting cultural heritage collections. This article addresses temporal text classification using interpretable, feature-engineered tree-based machine learning models. We integrate five feature categories - compression-based, lexical structure, readability, neologism detection, and distance features - to predict the temporal origin of English texts spanning five centuries. Comparative analysis shows that these feature domains provide complementary temporal signals, with combined models outperforming any individual feature set. On a large-scale corpus, we achieve 76.7% accuracy for century-scale prediction and 26.1% for decade-scale classification, substantially above random baselines (20% and 2.3%). Under relaxed temporal precision, performance increases to 96.0% top-2 accuracy for centuries and 85.8% top-10 accuracy for decades. The final model exhibits strong ranking capabilities with AUCROC up to 94.8% and AUPRC up to 83.3%, and maintains controlled errors with mean absolute deviations of 27 years and 30 years, respectively. For authentication-style tasks, binary models around key thresholds (e.g., 1850-1900) reach 85-98% accuracy. Feature importance analysis identifies distance features and lexical structure as most informative, with compression-based features providing complementary signals. SHAP explainability reveals systematic linguistic evolution patterns, with the 19th century emerging as a pivot point across feature domains. Cross-dataset evaluation on Project Gutenberg highlights domain adaptation challenges, with accuracy dropping by 26.4 percentage points, yet the computational efficiency and interpretability of tree-based models still offer a scalable, explainable alternative to neural architectures.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 46 references that are in the map. First posted on arXiv 28 Nov 2025.

Builds on

13 of 46 references.

References · 13

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  4. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  5. 2021Deep Neural Networks and Tabular Data: A Surveycited by 491
  6. 2020Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlationcited by 425
  7. 2022Why do tree-based models still outperform deep learning on tabular data?cited by 199
  8. 2020A Survey on Text Classification: From Shallow to Deep Learningcited by 80
  9. 2015A Primer on Neural Network Models for Natural Language Processingcited by 76
  10. 2018A standardized Project Gutenberg corpus for statistical analysis of natural language and quantitative linguisticscited by 64
  11. 2021Temporal Effects on Pre-trained Models for Language Processing Taskscited by 46
  12. 2022Building for Tomorrow: Assessing the Temporal Persistence of Text Classifierscited by 8
1 more
  1. 2024AIDetx: a compression-based method for identification of machine-learning generated textcited by 1

Built on by

Not cited yet.