Skip to content
Book Open access

Cost-Aware Human-LLM Collaboration for Post-OCR Corrections in Swiss Historical Newspapers

Aug 2026 · Proceedings of the 2026 ACM Symposium on Document Engineering · pp. 1-4 · 0 citations · 19 references

TL;DR

A regression-guided routing approach that prioritizes segments by predicted CER improvement, paired with a safeguard layer that detects harmful LLM corrections and routes uncertain segments to human review, and substantially outperforms standard confidence-based approaches is introduced.

Abstract

OCR transcription errors in historical archives often hinder digital search and retrieval. While Large Language Models (LLMs) can correct many of these errors, applying them indiscriminately is costly and may negatively affect already-clean text. We propose a three-tier collaboration framework that routes each text segment to one of: (1) No Correction, (2) LLM Correction, or (3) Human Correction. We introduce a regression-guided routing approach that prioritizes segments by predicted CER improvement, paired with a safeguard layer that detects harmful LLM corrections and routes uncertain segments to human review. With only <5% of the corpus reviewed by human experts, our safeguard achieves a 14% relative reduction over the All-LLM baseline, and substantially outperforms standard confidence-based approaches. By dynamically routing degraded segments to humans and fixable errors to the LLM, the collaborative framework outperforms either corrector in isolation.

Read PDF

Similar papers

Preprint Aug 2026

EVIL-Detect for NLPCC 2026 Shared Task 6: LLM-Generated Text Detection

The rapid development of large language models (LLMs) has increased the need for reliable detection of LLM-generated text, especially in realistic Chinese scenarios involving human-written text (HWT), LLM-generated text (LGT), and LLM-refined text (HLT). This paper presents EVIL-Detect, a multi-signal ensemble framework with conflict-aware fusion for NLPCC 2026 Shared Task 6. The system integrates edit-extent regression, zero-shot likelihood-contrast signals, lexical statistics, and conservative text rules. With calibrated decision boundaries and conflict-aware integration, our system improves robustness under strong out-of-distribution shifts, achieving a macro-F1 score of 0.8888 and ranking first in the official evaluation. Our code is available at https://github.com/bbbbhrrrr/evildetect.

Hongrui Bao, Hangyu Rong, Zhuo Wang et al. · 0 citations
Preprint Jul 2026

A Human-in-the-Loop Corpus for LLM-Based Simplification of Scientific Summaries

This work study large language model (LLM)-based simplification of scientific texts and presents a human-in-the-loop workflow that transforms expert summaries into more accessible versions for non-specialists.

Kyuri Im, Michael Färber · 0 citations
Open access Jul 2026

A Comprehensive Approach to Misspelling Correction with Contextual Word Embeddings and Levenshtein Distance

Spelling errors are common in written text and can seriously affect both readability and the performance of natural language processing systems. This problem is especially challenging in Persian due to complex spelling rules, similar letter forms, and context-dependent word usage. In this work, we propose a spelling correction framework that combines contextual information from BERT masked language models with edit-distance-based candidate generation. The method is designed to handle both non-real-word errors, where the misspelled word is invalid, and real-word errors, where a valid word is used incorrectly in context. To support this task, we construct a large Persian dataset with systematically generated spelling errors based on common typing and linguistic patterns. We also introduce heuristic correction strategies and a biasing mechanism that improves the model’s focus on erroneous words. Extensive experiments using multiple Persian BERT variants show that the proposed approach consistently outperforms a strong BERT-based baseline and widely used external systems. The results demonstrate notable improvements in F1-score, particularly for context-dependent real-word errors, while maintaining efficient runtime performance. These findings suggest that the proposed method is well-suited for practical Persian spelling correction applications.

Amirreza Naziri, Hossein Zeinali · 0 citations
Preprint Jul 2026

Every Time I Hire a Linguist, Inference Costs Go Down: On Linguistic Rules as Effective Prompt Compressors

Prompt compression shortens LLM input to reduce inference cost, yet existing methods score token importance through LM forward passes. It remains questionable whether such nuanced, costly token selection is necessary. Compression requires identifying informative content, a problem that linguistic research has long addressed through cues that can be operationalized as deterministic rules. We therefore ask: can \textbf{linguistic rules alone} serve as effective prompt compressors, without LM-based scoring at compression time? To address this, we conduct offline evolutionary search over lexical, syntactic, semantic, and discourse seeds to find competitive rule combinations. The resulting linguistic compressor requires no LM forward pass at deployment and uses only CPU-side processing for compression. We evaluate it with a dual-path protocol to balance compression quality and reconstruction fidelity. Across short passages, multi-document reasoning, and dialogue-memory QA datasets, evolved compressors achieve performance similar to that of recent advanced prompt-compression strategies. Performance is strongest under light-to-moderate compression and degrades as compression becomes more aggressive, while the Direct and Reconstruction paths exhibit distinct patterns. Evolutionary analysis reveals that effective compression fuses signals across linguistic levels and, as the compression ratio increases, rules shift from token pruning to sentence extraction.

Jianfei Ma, Zhaoxin Feng, Emmanuele Chersoni et al. · 0 citations
Preprint Open access Jul 2026

ICDAR 2026 HIPE-OCRepair Competition on LLM-Assisted OCR Post-Correction for Historical Documents

We present the results of HIPE-OCRepair-2026, an ICDAR competition on LLM-assisted OCR post-correction of historical documents. OCR post-correction remains a long-standing challenge in digital heritage: large-scale collections of digitized documents are affected by legacy OCR errors, while re-digitization at scale remains impractical. Large language models (LLMs) offers a major opportunity to revisit this challenge, yet their effectiveness across languages, document types, and noise conditions - and their tendency to hallucinate - remains insufficiently understood. HIPE-OCRepair-2026 pursues two objectives: (i) to evaluate the capabilities of modern OCR post-correction systems, and (ii) to provide a reproducible evaluation framework anchored in the HIPE-OCRepair-2026 dataset, a harmonized multilingual resource consolidating existing and newly curated historical datasets. Participants were tasked with correcting noisy OCR transcripts from historical newspapers and printed works in English, French, and German (17th-20th century), working at the level of coherent transcription units (paragraphs or articles) without access to source images. The evaluation adopts a retrieval-oriented rather than diplomatic scoring approach, reflecting the practical use case of search and access over digitized collections. Four teams submitted systems ranging from zero-shot prompting to continued pre-training and fine-tuning, offering insights into the merits of different adaptation strategies. Results show that modern LLM-assisted systems can significantly improve OCR quality, but performance varies across datasets, languages, and noise levels. Over-correction on low-noise inputs emerges as a recurring challenge, highlighting the importance of evaluation beyond character error reduction. The dataset, scorer, and evaluation pipeline are publicly released to support future research.

Maud Ehrmann, E. Boros, Juri Opitz et al. · 0 citations