Skip to content
Preprint

Reading Order Inference for Complex Document Layouts

Jul 2026 · 0 citations · 17 references
Computer Science

TL;DR

A max-regret inference rule is proposed that prioritizes commitments with high opportunity cost in reading order inference to avoid the cascading"edge-theft"failures of greedy edge selection.

Abstract

Reading order inference remains a critical bottleneck in the digitization of complex historical manuscripts, where pages contain multiple spatially interleaved reading streams, the canonical example being the Glossa Ordinaria layout, in which a central text is surrounded by commentaries that wrap around it in non-rectangular, non-convex regions. We present a training-free, graph-based framework: each OCR text line becomes a node in a directed candidate-transition graph, edges are scored by a weighted additive ensemble of two lightweight language-model signals (causal language model conditional likelihood and BERT next-sentence prediction, NSP; a third sentence-embedding signal was evaluated but did not improve reading order), and the global reading order is recovered as a degree-constrained directed path cover. To avoid the cascading"edge-theft"failures of greedy edge selection, we propose a max-regret inference rule that prioritizes commitments with high opportunity cost. We evaluate on synthetic Glossa Ordinaria grid layouts, on 23 ALTO page geometries (10 historical source pages plus mirrored and flipped variants), and on a 140-page multi-column English subset of OmniDocBench, comparing our method against the canonical recursive XY-cut (PaddleOCR PP-StructureV3) and two LayoutReader variants (layout-only and text+layout) on identical inputs. On wrap-around Glossa layouts our method recovers 95% of ground-truth successor edges on average vs. XY-cut's 50%; on the OmniDocBench multi-column subset it reaches 88% macro edge accuracy versus XY-cut's 75% and LayoutReader's 25%. The LayoutReader baselines transfer poorly due to a word-level vs. line-level granularity mismatch. We additionally verify mirror-invariance under horizontal and vertical page reflections: Our method changes by less than 1 percentage point, classical XY-cut by 2 points, and LayoutReader-T by up to 8 points.

View source

Similar papers

Jul 2026

Towards Hierarchical Structure Understanding of Newspaper Images

Understanding newspaper images remains a challenging task due to their complex, nested hierarchical structures and dense, heterogeneous layouts. In this paper, we explore two complementary approaches for newspaper structure understanding. First, we present a modular bottom-up pipeline that combines state-of-the-art ope...

William Mocaër, Solène Tarride, Thomas Constum et al. · 0 citations
Preprint Aug 2026

PaDoc: Layout-Grounded Parallel Decoding for Document Parsing

PaDoc is proposed, a layout-grounded parser that treats the predicted layout as a branching structure over a shared page representation that is the fastest end-to-end parser at five concurrency levels and is the fastest end-to-end parser at five concurrency levels.

Hao Yu, Jia-Bo Zhan, Kang Liu et al. · 1 citation
Preprint Aug 2026

FRAGMENT: Factorized Graph Representations for Document Generation and Editing via Entity-Aware Transformations

Experiments on DocLayNet, FUNSD, and SROIE evaluate FRAGMENT alongside representative autoregressive, layout-only, and graph-based baselines, providing an empirical analysis of the characteristics and trade-offs of the proposed factorized graph generation framework.

Ayoub El Bouchtili, Guilhaume Leroy-Meline · 0 citations
Jul 2026

HierDoc: Hierarchical Page-to-Region Evidence Routing for Long-Document Visual Question Answering

HierDoc, a hierarchical evidence-routing framework that formulates long-document evidence acquisition as two-stage set prediction from pages to regions, achieves state-of-the-art or competitive performance among open-weight systems, improving LongDocURL by 16.87% relative to the strongest reported open-weight baseline.

Rongjian Gu, Weng Zhou, Junyu Xiong et al. · 0 citations
Jul 2026

When Does Explicit View Routing Work? A Controlled Study of Multi-View Graph-Text Alignment

The controlled version of MV-GTA uses deterministic, verifiable text segments; isolated text encoders; view-specific graph heads; and relevance derived from external labels or RDKit descriptors, but does not establish free-form routing, consistent three-view specialization, statistical equivalence to specialists, or su...

X. Yue, Guangzhi Qu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.