Table Structure Recognition

Overview

Table structure recognition studies how to recover a table’s rows, columns, cell boundaries, spanning cells, and hierarchy from images or document pages, often alongside cell text. Approaches include grid and object detection, graph-based prediction, autoregressive HTML or OTSL generation, and vision-language models guided by spatial or structural priors. Systems are commonly evaluated on benchmarks such as PubTabNet, FinTabNet, and PubTables-1M using structural and content metrics such as TEDS and GriTS. A central challenge is handling complex, degraded, or unfamiliar tables: strong scores on clean benchmarks do not guarantee reliable real-world extraction, and accurate structure alone does not ensure sound question answering or arithmetic.

Latest papers

32 papers1 paper in the last four weeks, down 83% on the four weeks before. 0.0% of all new papers.

Feb 2, 2026

Orthogonal Hierarchical Decomposition for Structure-Aware Table Understanding with Large Language Models

Complex tables with multi-level headers, merged cells and heterogeneous layouts pose persistent challenges for LLMs in both understanding and reasoning. Existing approaches typically rely on table linearization or normalized grid modeling. However, these representations struggle to explicitly capture hierarchical structures and cross-dimensional dependencies, which can lead to misalignment between structural semantics and textual representations for non-standard tables. To address this issue, we propose an Orthogonal Hierarchical Decomposition (OHD) framework that constructs structure-preserving input representations of complex tables for LLMs. OHD introduces an Orthogonal Tree Induction (OTI) method based on spatial--semantic co-constraints, which decomposes irregular tables into a column tree and a row tree to capture vertical and horizontal hierarchical dependencies, respectively. Building on this representation, we design a dual-pathway association protocol to symmetrically reconstruct semantic lineage of each cell, and incorporate an LLM as a semantic arbitrator to align multi-level semantic information. We evaluate OHD framework on two complex table question answering benchmarks, AITQA and HiTab. Experimental results show that OHD consistently outperforms existing representation paradigms across multiple evaluation metrics.
Dec 30, 2024

Enhancing Table Recognition with Vision LLMs: A Benchmark and Neighbor-Guided Toolchain Reasoner

Pre-trained foundation models have recently made significant progress in table-related tasks such as table understanding and reasoning. However, recognizing the structure and content of unstructured tables using Vision Large Language Models (VLLMs) remains under-explored. To bridge this gap, we propose a benchmark based on a hierarchical design philosophy to evaluate the recognition capabilities of VLLMs in training-free scenarios. Through in-depth evaluations, we find that low-quality image input is a significant bottleneck in the recognition process. Drawing inspiration from this, we propose the Neighbor-Guided Toolchain Reasoner (NGTR) framework, which is characterized by integrating diverse lightweight tools for visual operations aimed at mitigating issues with low-quality images. Specifically, we transfer a tool selection experience from a similar neighbor to the input and design a reflection module to supervise the tool invocation process. Extensive experiments on public datasets demonstrate that our approach significantly enhances the recognition capabilities of the vanilla VLLMs. We believe that the benchmark and framework could provide an alternative solution to table recognition.