mlsanityData to 14 Oct 2026

Information Extraction From Fiscal Documents Using LLMs

arXiv 2511.10659 ↗First posted 3 Nov 2025cs.CL cs.IRcited by 3

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) have demonstrated remarkable capabilities in text comprehension, but their ability to process complex, hierarchical tabular data remains underexplored. We present a novel approach to extracting structured data from multi-page government fiscal documents using LLM-based techniques. Applied to annual fiscal documents from the State of Karnataka in India (200+ pages), our method achieves high accuracy through a multi-stage pipeline that leverages domain knowledge, sequential context, and algorithmic validation. A large challenge with traditional OCR methods is the inability to verify the accurate extraction of numbers. When applied to fiscal data, the inherent structure of fiscal tables, with totals at each level of the hierarchy, allows for robust internal validation of the extracted data. We use these hierarchical relationships to create multi-level validation checks. We demonstrate that LLMs can read tables and also process document-specific structural hierarchies, offering a scalable process for converting PDF-based fiscal disclosures into research-ready databases. Our implementation shows promise for broader applications across developing country contexts.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 4 of its 16 references that are in the map. First posted on arXiv 3 Nov 2025.

Builds on

4 of 16 references.

References · 4

  1. 2019Image-based table recognition: data, model, and evaluationcited by 237
  2. 2024TableBench: A Comprehensive and Complex Benchmark for Table Question Answeringcited by 128
  3. 2024Large Language Model for Table Processing: A Surveycited by 52
  4. 2025TableEval: A Real-World Benchmark for Complex, Multilingual, and Multi-Structured Table Question Answeringcited by 15

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.