From Diagnosis to Correction: Benchmarking and Improving Real-World Table Parsing
- URL: http://arxiv.org/abs/2608.09842v1
- Date: Mon, 10 Aug 2026 16:59:30 GMT
- Title: From Diagnosis to Correction: Benchmarking and Improving Real-World Table Parsing
- Abstract summary: Recent documents achieve table TEDS scores above 93 on OmniDocBench v1.6, yet community feedback and our audit reveal persistent failures on complex real-world tables.<n>To quantify this gap, we introduce TableParseMap, a diagnostic benchmark of 916 real-world tables organized into five challenging scenarios and nine failure types.
- Score: 50.70862449978062
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recent document parsers achieve table TEDS scores above 93 on OmniDocBench v1.6, yet community feedback and our audit reveal persistent failures on complex real-world tables. To quantify this gap, we introduce TableParseMap, a diagnostic benchmark of 916 real-world tables organized into five challenging scenarios and nine failure types. The strongest evaluated parser achieves only 85.03 TEDS, showing that aggregate benchmark scores conceal substantial weaknesses. Our analysis attributes these failures to three complementary limitations: large tables exceed the reliable processing scale of a single pass, weak or ambiguous visual cues hinder structure perception, and the reconstructed table may remain visually inconsistent with the image. We therefore propose DEC (Decompose--Enhance--Correct), a visual-consistency-guided agentic framework that improves frozen table parsers without retraining. DEC uses a general VLM as the controller: Decompose partitions large tables along structure-aware boundaries, Enhance exposes weak visual evidence and reparses transformed views, and Correct diagnoses and repairs residual errors. A Visual Consistency Gate (VC-Gate) selectively triggers intervention, while a Visual Consistency Ranker (VC-Ranker) verifies candidate updates and supports rollback without ground-truth HTML at inference time. We further derive a 1,977-table Consensus-Hard Set from 4,556 candidates through offline metrics and cross-model consensus. Across three frozen parsers, DEC improves TEDS by 1.57 points on average; on TableParseMap, gains reach 1.89 points overall, 2.62 on structural errors, and 5.66 on large tables.
Related papers
- Where vs What: Decomposing Structural and Content Failures in LLM-Generated Structured Outputs [15.823269213947347]
We introduce Structure-Content Decomposition (SCD), a framework that measures structural fidelity and content accuracy.<n>Applying SCD to nested and table tasks across six models (7B to frontier), we uncover a consistent phenomenon: structural fidelity degrades earlier and more sharply than content accuracy increases.<n>We propose SA-RLVR, converting SCD metrics into verifiable rewards for learning.
arXiv Detail & Related papers (2026-08-26T04:32:06Z) - StrucTab: A Structured Optimization Framework for Table Parsing [33.4550862402289]
StrucTab is a table parsing model learned through intermediate structural supervision and reward decomposition.<n>At the modeling level, by decomposing the parsing process into human-inspired subtasks, StrucTab progressively unifies them through a sequential reasoning strategy.<n>At the optimization level, we introduce Uni-TabRL, a unified RL framework that leverages decomposed rewards to provide stable and informative optimization signals.
arXiv Detail & Related papers (2026-06-29T07:41:39Z) - How Far Is Document Parsing from Solved? PureDocBench: A Source-TraceableBenchmark across Clean, Degraded, and Real-World Settings [56.70440596502351]
The past year has seen over 20 open document parsing models, yet benchmarks almost exclusively on OmniDocBench.<n>We present PureDocBench, a benchmark thatrenders document images from HTML/CSS, covering 10 domains, 66 pages, and 1,475 pages.
arXiv Detail & Related papers (2026-05-08T09:30:31Z) - HighlightBench: Benchmarking Markup-Driven Table Reasoning in Scientific Documents [88.16322879912458]
multimodal large language models (MLLMs) have made substantial progress in document understanding, but their ability to treat such cues as explicit logical directives remains under-explored.<n>We introduce HighlightBench, a diagnostic benchmark for markup-driven table understanding that decomposes evaluation into five task families.<n>We show that even strong models remain unstable when visual cues must be consistently aligned with symbolic reasoning under structured output constraints.
arXiv Detail & Related papers (2026-03-25T06:15:40Z) - QUIETT: Query-Independent Table Transformation for Robust Reasoning [21.03903792753972]
Real-world tables often exhibit irregular schemas, heterogeneous value formats, and implicit relational structure.<n>We introduce QuIeTT, a query-independent table transformation framework.<n>We show consistent gains across models and reasoning paradigms, with particularly strong improvements on a challenge set of structurally diverse, unseen questions.
arXiv Detail & Related papers (2026-02-23T16:23:49Z) - GLEAN: Grounded Lightweight Evaluation Anchors for Contamination-Aware Tabular Reasoning [0.5414847001704249]
We propose a lightweight evaluation protocol that integrates contamination-aware probes, weak-supervision governance, retrieval-reasoning diagnostics, and structured error attribution.<n>We evaluate across TabFact, WTQ via Squall, TableBench, RobuT, and SciTab under a 16GB GPU budget.
arXiv Detail & Related papers (2026-01-22T13:56:19Z) - CORE-T: COherent REtrieval of Tables for Text-to-SQL [91.76918495375384]
CORE-T is a scalable, training-free framework that enriches tables with purpose metadata and pre-computes a lightweight table-compatibility cache.<n>Across Bird, Spider, and MMQA, CORE-T improves table-selection F1 by up to 22.7 points while retrieving up to 42% fewer tables.
arXiv Detail & Related papers (2026-01-19T14:51:23Z) - TabReX : Tabular Referenceless eXplainable Evaluation [15.411207072791806]
TabReX is a reference-less, property-driven framework for evaluating tables generated by large language models.<n>It computes interpretable, rubric-aware scores that quantify structural and factual fidelity.<n>To asses robustness, we introduce TabReX-Bench, a large-scale benchmark spanning six domains and twelve planner-driven perturbation types.
arXiv Detail & Related papers (2025-12-17T19:20:20Z) - Doc2SoarGraph: Discrete Reasoning over Visually-Rich Table-Text
Documents via Semantic-Oriented Hierarchical Graphs [79.0426838808629]
We propose TAT-DQA, i.e. to answer the question over a visually-rich table-text document.
Specifically, we propose a novel Doc2SoarGraph framework with enhanced discrete reasoning capability.
We conduct extensive experiments on TAT-DQA dataset, and the results show that our proposed framework outperforms the best baseline model by 17.73% and 16.91% in terms of Exact Match (EM) and F1 score respectively on the test set.
arXiv Detail & Related papers (2023-05-03T07:30:32Z) - Aligning benchmark datasets for table structure recognition [10.323063834827416]
Benchmark datasets for table structure recognition (TSR) must be carefully processed to ensure they are consistently.
In this work, we show that aligning these benchmarks$x$removing errors and inconsistency between them$x$improves performance significantly.
Overall we believe our work has significant implications for benchmark processing performance and potentially other tasks as well.
arXiv Detail & Related papers (2023-03-01T18:20:24Z) - TACRED Revisited: A Thorough Evaluation of the TACRED Relation
Extraction Task [80.38130122127882]
TACRED is one of the largest, most widely used crowdsourced datasets in Relation Extraction (RE)
In this paper, we investigate the questions: Have we reached a performance ceiling or is there still room for improvement?
We find that label errors account for 8% absolute F1 test error, and that more than 50% of the examples need to be relabeled.
arXiv Detail & Related papers (2020-04-30T15:07:37Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.