Efficient Domain Adaptation for Text Line Recognition via Decoupled Language Models
Not on the map. Why?
Abstract (arXiv)
Optical character recognition remains critical infrastructure for document digitization, yet state-of-the-art performance is often restricted to well-resourced institutions by prohibitive computational barriers. End-to-end transformer architectures achieve strong accuracy but demand hundreds of GPU hours for domain adaptation, limiting accessibility for practitioners and digital humanities scholars. We present a modular detection-and-correction framework that achieves near-SOTA accuracy with single-GPU training. Our approach decouples lightweight visual character detection (domain-agnostic) from domain-specific linguistic correction using pretrained sequence models including T5, ByT5, and BART. By training the correctors entirely on synthetic noise, we enable annotation-free domain adaptation without requiring labeled target images. Evaluating across modern clean handwriting, cursive script, and historical documents, we identify a critical "Pareto frontier" in architecture selection: T5-Base excels on modern text with standard vocabulary, whereas ByT5-Base dominates on historical documents by reconstructing archaic spellings at the byte level. Our results demonstrate that this decoupled paradigm matches end-to-end transformer accuracy while reducing compute by approximately 95%, establishing a viable, resource-efficient alternative to monolithic OCR architectures.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 48 references that are in the map. First posted on arXiv 30 Mar 2026.
Builds on
25 of 48 references.
References · 25
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2019Generalized Intersection over Union: A Metric and A Loss for Bounding Box Regressioncited by 1,361
- 2022DINO: DETR with Improved DeNoising Anchor Boxes for End-to-End Object Detectioncited by 1,306
- 2019PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarizationcited by 1,100
- 2020Multilingual Denoising Pre-training for Neural Machine Translationcited by 1,028
- 2019LayoutLM: Pre-training of Text and Layout for Document Image Understandingcited by 549
- 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 504
- 2022LayoutLMv3: Pre-training for Document AI with Unified Text and Image Maskingcited by 481
- 2019MASS: Masked Sequence to Sequence Pre-training for Language Generationcited by 345
- 2021TrOCR: Transformer-based Optical Character Recognition with Pre-trained Modelscited by 278
13 more
- 2020ProphetNet: Predicting Future N-gram for Sequence-to-Sequence Pre-trainingcited by 221
- 2020Towards Accurate Scene Text Recognition with Semantic Reasoning Networkscited by 131
- 2018Chargrid: Towards Understanding 2D Documentscited by 100
- 2022DAN: a Segmentation-free Document Attention Network for Handwritten Document Recognitioncited by 62
- 2021Rethinking Text Line Recognition Modelscited by 45
- 2023DTrOCR: Decoder-only Transformer for Optical Character Recognitioncited by 40
- 2022Recognition of Handwritten Chinese Text by Segmentation: A Segment-annotation-free Approachcited by 14
- 2018HWNet v2: An Efficient Word Image Representation for Handwritten Documentscited by 13
- 2021Neural OCR Post-Hoc Correction of Historical Corporacited by 12
- 2023Faster DAN: Multi-target Queries with Document Positional Encoding for End-to-end Handwritten Document Recognitioncited by 9
- 2016OCR Error Correction Using Character Correction and Feature-Based Word Classificationcited by 7
- 2020A Tool for Facilitating OCR Postediting in Historical Documentscited by 4
- 2024General Detection-based Text Line Recognitioncited by 4
Built on by
Not cited yet.