From Pixels to Pairs: A Comprehensive Benchmark of LLM-Based Key-Value Extraction in Noisy Document Settings
Summary
This paper introduces a comprehensive benchmark for evaluating LLMs in key-value extraction from documents under OCR noise, revealing substantial performance degradation and emphasizing the need for joint optimization of OCR quality and LLM reasoning.
View Cached Full Text
Cached at: 09/17/26, 08:43 AM
# From Pixels to Pairs: A Comprehensive Benchmark of LLM-Based Key–Value Extraction in Noisy Document Settings
Source: [https://arxiv.org/html/2609.17538](https://arxiv.org/html/2609.17538)
Vassilis AthitsosProfessor, Computer Science and Engineering, University of Texas at Arlington\. Email:athitsos@uta\.edu
###### Abstract
Large language models \(LLMs\) are increasingly used for structured information extraction from documents, yet their behavior under realistic OCR noise remains poorly understood\. In this work, we present a systematic and controlled benchmark of open\-source instruction\-tuned LLMs for key–value pair \(KVP\) extraction under both clean\-text and noisy OCR conditions\.
We evaluate representative decoder\-only models \(Gemma, Mistral, Qwen2\.5, LLaMA 3, and DeepSeek\) on three document benchmarks \(FUNSD, CORD, and SROIE\), using both Gold\-text annotations and OCR outputs from PaddleOCR, EasyOCR, and Tesseract\. Our unified evaluation protocol isolates the effects of input quality, model design, and prompting under consistent conditions\.
Our results show that modern LLMs act as strong semantic extractors when high\-quality text is available, in some cases approaching the performance of supervised layout\-aware systems under clean\-text conditions\. However, this capability does not translate reliably to realistic settings\. Under OCR noise, performance degrades substantially, and performance gaps between models narrow as input corruption increases\.
Across all datasets and models, we observe that extraction performance is governed by a two\-stage bottleneck: \(1\) semantic reasoning over text and \(2\) preservation of textual fidelity under OCR noise\. While model scaling improves results in the clean\-text regime, these gains diminish under noisy inputs, where upstream text quality becomes the dominant factor\.
We further identify recurring failure modes—including key–value misalignment, hallucination, and numeric corruption—that are amplified by OCR errors and prompt sensitivity\.
Overall, our findings highlight a fundamental gap between clean\-text evaluation and real\-world deployment, and demonstrate that robust document extraction requires jointly addressing OCR quality, structural reasoning, and LLM\-based semantic modeling\.
## 1Introduction
Key–value pair \(KVP\) extraction is a core task in Document AI, enabling applications such as invoice processing, receipt understanding, form digitization, and enterprise automation\[[11](https://arxiv.org/html/2609.17538#bib.bib1),[9](https://arxiv.org/html/2609.17538#bib.bib3)\]\. Traditional pipelines typically combine optical character recognition \(OCR\) with heuristic post\-processing and domain\-specific rules\. While effective in controlled settings, these approaches degrade under real\-world conditions where documents exhibit noise, irregular layouts, and non\-standard field structures\. In practice, OCR errors—such as token fragmentation, line merging, and numeric corruption—propagate directly to downstream extraction systems and reduce reliability\.
Large language models \(LLMs\) have recently introduced a new paradigm for document understanding\[[1](https://arxiv.org/html/2609.17538#bib.bib21),[12](https://arxiv.org/html/2609.17538#bib.bib23),[26](https://arxiv.org/html/2609.17538#bib.bib22)\]\. Rather than explicitly modeling layout or visual structure, instruction\-tuned LLMs can infer semantic relationships directly from text using large\-scale pretraining and in\-context reasoning\. Under clean input conditions, prior work has shown that LLMs can perform structured extraction tasks without task\-specific fine\-tuning\[[27](https://arxiv.org/html/2609.17538#bib.bib26),[25](https://arxiv.org/html/2609.17538#bib.bib32)\]\. However, most existing evaluations rely on clean, human\-curated text rather than OCR\-generated inputs\. This distinction is critical, as OCR noise remains a primary source of error in real\-world document processing pipelines\.
This discrepancy creates a gap between benchmark evaluation and deployment conditions\. Reported improvements may reflect performance under idealized inputs rather than robustness to realistic noise\. In addition, comparisons across models are often influenced by inconsistent prompting strategies, post\-processing pipelines, or dataset\-specific assumptions, making it difficult to isolate the effect of model capability\. Existing studies also tend to evaluate datasets in isolation, despite the fact that forms and receipts impose distinct structural and semantic challenges\.
In this work, we present a controlled benchmark of LLM\-based KVP extraction under both clean\-text and OCR\-derived inputs\. The benchmark evaluates models across multiple datasets representing diverse document types, including forms \(FUNSD\[[11](https://arxiv.org/html/2609.17538#bib.bib1)\]\) and receipts \(SROIE\[[9](https://arxiv.org/html/2609.17538#bib.bib3)\], CORD\[[19](https://arxiv.org/html/2609.17538#bib.bib2)\]\)\. To reflect realistic deployment scenarios, performance is assessed under two input regimes: Gold\-text derived from ground\-truth annotations and OCR\-generated text produced by widely used engines, including Tesseract\[[23](https://arxiv.org/html/2609.17538#bib.bib17)\], EasyOCR\[[10](https://arxiv.org/html/2609.17538#bib.bib19)\], and PaddleOCR\[[5](https://arxiv.org/html/2609.17538#bib.bib18)\]\.
Our analysis examines how extraction performance varies with both model capability and input quality\. While stronger models improve performance under clean\-text conditions, these gains become less pronounced as input quality degrades\. This suggests that improvements in model capacity do not consistently translate to proportional gains under realistic OCR conditions\.
A diverse set of instruction\-tuned open\-source LLMs were evaluated, including Gemma\[[26](https://arxiv.org/html/2609.17538#bib.bib22)\], Mistral\[[12](https://arxiv.org/html/2609.17538#bib.bib23)\], Qwen2\.5\[[20](https://arxiv.org/html/2609.17538#bib.bib24)\], DeepSeek\[[3](https://arxiv.org/html/2609.17538#bib.bib25)\], and LLaMA 3\[[1](https://arxiv.org/html/2609.17538#bib.bib21)\]\. To ensure fair comparison, all models are evaluated using a unified prompting framework, deterministic decoding, and a strictly non\-semantic canonicalization pipeline that standardizes output format without introducing heuristic extraction logic\.
Performance is measured using complementary metrics including Key Recall, Exact Match \(EM\), and Value\-level F1, capturing field coverage, strict correctness, and robustness to textual variation\. This setup enables controlled analysis of model behavior across datasets and input regimes\.
Our results show several consistent patterns\. First, instruction\-tuned LLMs achieve strong extraction performance under clean\-text conditions across all datasets\. Second, performance decreases under OCR inputs, with the magnitude of degradation varying by dataset and document structure\. Third, differences between models become less pronounced as input quality decreases\. Finally, few\-shot prompting improves performance in many settings, but its impact depends on dataset regularity and input quality\.
This benchmark enables systematic evaluation of LLM\-based document extraction under realistic OCR conditions and facilitates controlled comparison across models, prompting strategies, and document collections\. Overall, our findings highlight the importance of evaluating models under realistic input conditions and clarify when prompt\-based LLM extraction is effective in practice\.
##### Contributions\.
This paper makes the following contributions:
- •We present a controlled benchmark for evaluating instruction\-tuned open\-source LLMs on text\-only key–value pair \(KVP\) extraction under both clean\-text and OCR\-derived inputs, enabling systematic analysis of extraction robustness across realistic document processing conditions\.
- •We conduct a comprehensive empirical study across multiple instruction\-tuned LLMs, diverse document collections \(FUNSD, SROIE, and CORD\), and multiple OCR engines using a unified evaluation protocol\.
- •We introduce a standardized evaluation protocol with deterministic decoding and non\-semantic output canonicalization, enabling fair and reproducible comparison across models and prompting strategies\.
- •We provide a detailed analysis of the effects of OCR quality, document structure, prompting, and model scale, and identify the dominant failure modes that limit text\-only LLM\-based document extraction\.
- •This benchmark provides a reproducible evaluation framework for future research on LLM\-based document understanding\.
## 2Related Work
### 2\.1Key–Value Pair Extraction in Document AI
Key–value pair \(KVP\) extraction is a fundamental task in Document AI, enabling applications such as invoice processing, form digitization, identity document parsing, and enterprise automation\. Early approaches relied on hand\-crafted templates, regular\-expression heuristics, and spatial rules\[[21](https://arxiv.org/html/2609.17538#bib.bib4),[6](https://arxiv.org/html/2609.17538#bib.bib5)\]\. While effective in controlled settings, these systems were brittle: minor layout changes, OCR artifacts, or domain shifts often caused failures\. Their reliance on fixed patterns limited semantic generalization and required extensive manual effort to adapt across document types\.
Deep learning significantly advanced this area\. Chargrid\[[13](https://arxiv.org/html/2609.17538#bib.bib11)\]introduced grid\-based representations that encode both text and spatial layout, enabling convolutional models to jointly reason over content and structure\. The release of FUNSD\[[11](https://arxiv.org/html/2609.17538#bib.bib1)\]further accelerated progress by providing a benchmark for form understanding and key–value linking\. However, many neural approaches still depend on large annotated datasets and struggle to generalize across unseen layouts or document domains\.
### 2\.2Layout\-Aware Architectures
Layout\-aware transformers represent a major advancement by integrating textual content with spatial and visual features\. LayoutLM\[[30](https://arxiv.org/html/2609.17538#bib.bib6)\]demonstrated that combining language modeling with 2D positional embeddings yields strong performance on key information extraction tasks\. Subsequent variants such as LayoutLMv2 and LayoutLMv3\[[31](https://arxiv.org/html/2609.17538#bib.bib7),[8](https://arxiv.org/html/2609.17538#bib.bib8)\]further improved results through multimodal pretraining and better alignment between visual and textual signals\.
Follow\-up models—including DocFormer\[[2](https://arxiv.org/html/2609.17538#bib.bib9)\], FormNet\[[15](https://arxiv.org/html/2609.17538#bib.bib10)\], StructuralLM\[[16](https://arxiv.org/html/2609.17538#bib.bib31)\], and UDOP\[[25](https://arxiv.org/html/2609.17538#bib.bib32)\]—extended this paradigm with more sophisticated fusion mechanisms and hierarchical representations\. These approaches achieve strong performance on benchmarks such as FUNSD\[[11](https://arxiv.org/html/2609.17538#bib.bib1)\], CORD\[[19](https://arxiv.org/html/2609.17538#bib.bib2)\], and SROIE\[[9](https://arxiv.org/html/2609.17538#bib.bib3)\]\.
Despite their effectiveness, layout\-aware models have practical limitations\. They rely on accurate OCR bounding boxes, which degrade under noisy scans or low\-resolution inputs\. Training often requires large\-scale annotated corpora, and deployment typically involves a full vision–language pipeline, increasing engineering complexity and computational cost\. Moreover, their reliance on explicit layout signals can limit robustness when structure is degraded\.
Recent multimodal generative systems such as Donut\[[14](https://arxiv.org/html/2609.17538#bib.bib13)\], DocVLM\[[22](https://arxiv.org/html/2609.17538#bib.bib16)\], and LayoutLLM\[[17](https://arxiv.org/html/2609.17538#bib.bib15)\]attempt to unify visual understanding with generative modeling\. While these approaches can leverage full document images, they are often less compatible with existing OCR\-based pipelines used in many real\-world systems\.
### 2\.3Large Language Models for Structured Extraction
Large language models \(LLMs\) have introduced a flexible paradigm for structured information extraction from semi\-structured text\. Modern decoder\-only, instruction\-tuned models—such as Mistral\[[12](https://arxiv.org/html/2609.17538#bib.bib23)\], Gemma\[[26](https://arxiv.org/html/2609.17538#bib.bib22)\], Qwen2\.5\[[20](https://arxiv.org/html/2609.17538#bib.bib24)\], DeepSeek\[[3](https://arxiv.org/html/2609.17538#bib.bib25)\], and LLaMA 3\[[1](https://arxiv.org/html/2609.17538#bib.bib21)\]—demonstrate strong zero\-shot and few\-shot capabilities across a wide range of extraction tasks\.
These models can infer key–value relationships, perform entity recognition, and generate structured outputs directly from natural\-language prompts, without task\-specific training\. Instruction tuning\[[29](https://arxiv.org/html/2609.17538#bib.bib27)\]and unified extraction frameworks such as InstructUIE\[[27](https://arxiv.org/html/2609.17538#bib.bib26)\]further highlight the ability of LLMs to generalize across extraction tasks using a single prompting interface\.
However, existing evaluations of LLM\-based document extraction remain limited\. Many studies rely on clean, human\-curated text rather than OCR outputs, making them unrepresentative of real\-world conditions\. Others evaluate only a narrow set of models or use inconsistent prompting and post\-processing strategies, hindering reproducibility and fair comparison\. As a result, the robustness of modern open\-source LLMs under realistic OCR noise remains insufficiently understood\.
### 2\.4OCR Noise and Robustness
OCR\-induced corruption is a primary source of failure in document processing pipelines\. Errors such as character substitutions, token fragmentation, and line reordering directly affect downstream extraction\. While robustness to noise has been studied in NLP\[[24](https://arxiv.org/html/2609.17538#bib.bib28),[18](https://arxiv.org/html/2609.17538#bib.bib29)\], relatively little work examines how LLMs behave under OCR\-generated text\.
In Document AI, evaluations are typically performed either on clean annotations or using end\-to\-end multimodal systems that bypass OCR\. Consequently, there is limited empirical understanding of how text\-only LLM extraction pipelines perform under realistic OCR conditions produced by widely used engines such as Tesseract\[[23](https://arxiv.org/html/2609.17538#bib.bib17)\], EasyOCR\[[10](https://arxiv.org/html/2609.17538#bib.bib19)\], and PaddleOCR\[[5](https://arxiv.org/html/2609.17538#bib.bib18)\]\.
### 2\.5Positioning of This Work
This work addresses these gaps by providing a controlled and reproducible benchmark of open\-source, instruction\-tuned decoder\-only LLMs for KVP extraction under both clean\-text and noisy OCR conditions\. We evaluate multiple model families across diverse document types \(forms and receipts\) and systematically vary OCR quality to isolate its impact on extraction performance\.
Our framework uses a unified prompting strategy, deterministic decoding, and a strictly non\-semantic canonicalization pipeline to ensure fair comparison across models\. By separating model capability from input quality, we provide a clearer understanding of when prompt\-based extraction succeeds and where it breaks down in realistic document processing settings\. To the best of our knowledge, this is the first benchmark to systematically evaluate multiple open\-source instruction\-tuned LLMs under multiple OCR engines using a unified and fully reproducible evaluation protocol across FUNSD, SROIE, and CORD\.
#### 2\.5\.1Dataset Samples and Visual Characteristics
Figures[1](https://arxiv.org/html/2609.17538#S2.F1),[2](https://arxiv.org/html/2609.17538#S2.F2), and[3](https://arxiv.org/html/2609.17538#S2.F3)show representative examples from the CORD, FUNSD, and SROIE datasets, illustrating the structural diversity and visual variability that drive many of the failure modes observed in this benchmark\.
##### CORD \(Receipts with dense numeric structure\)\.
CORD consists of Indonesian receipts with varying lengths and complexity\. Documents contain multiple itemized entries along with aggregated fields such as Subtotal, Service Charge, VAT, and Total\. As shown in Figure[1](https://arxiv.org/html/2609.17538#S2.F1), receipts exhibit blur, uneven lighting, color cast, and background clutter\.
These characteristics directly contribute to extraction errors observed in our results\. In particular, dense numeric regions and repeated values increase the risk of key–value misalignment, while OCR\-induced digit corruption \(e\.g\., “193\.00”→\\rightarrow“19300”\) significantly degrades Value F1\. Multi\-line item lists further introduce ambiguity in associating quantities, prices, and totals\.
##### FUNSD \(Form\-based documents with spatial dependencies\)\.
FUNSD contains scanned forms where key–value relationships are defined by spatial layout rather than sequential text\. As illustrated in Figure[2](https://arxiv.org/html/2609.17538#S2.F2), keys and values are often separated across regions \(e\.g\., left/right alignment or distant blocks\), requiring spatial reasoning to associate them correctly\.
When converted to OCR text, this spatial structure is largely lost, resulting in flattened sequences that obscure key–value relationships\. This leads to frequent value misalignment and reduced Exact Match scores in text\-only extraction settings, particularly for fields that rely on positional cues rather than explicit lexical markers\.
##### SROIE \(Receipts with limited schema\)\.
SROIE consists of shorter receipts with a small set of canonical fields such astotal,date, andaddress\. As shown in Figure[3](https://arxiv.org/html/2609.17538#S2.F3), these documents are structurally simpler than CORD but still exhibit OCR challenges including digit corruption, token merging, and inconsistent formatting\.
While the reduced annotation schema lowers structural ambiguity, it introduces a different evaluation challenge: semantically correct extractions outside the annotated schema are ignored\. In addition, even minor OCR variations in numeric or address fields can reduce both Exact Match and Value F1, making this dataset particularly sensitive to normalization errors\.
\(a\) Short receipt\(b\) Multi\-item receipt\(c\) Medium\-complexity receiptFigure 1:Representative CORD receipts illustrating dense numeric structure, multi\-line item lists, and real\-world imaging artifacts \(e\.g\., blur, lighting, background clutter\) that contribute to OCR\-induced errors and key–value misalignment\.\(a\) Form sample 1\(b\) Form sample 2\(c\) Form sample 3Figure 2:Representative FUNSD forms illustrating spatially distributed key–value relationships\. Layout\-dependent associations are lost when converted to OCR text, leading to value misalignment in text\-only extraction\.\(a\) Receipt sample 1\(b\) Receipt sample 2\(c\) Receipt sample 3Figure 3:Representative SROIE receipts illustrating simpler structure but persistent OCR variability \(digit corruption, token merging, formatting noise\), which affects numeric and address extraction accuracy\.
## 3Methodology and Experimental Setup
This section describes the methodological design and experimental configuration of this benchmark\. We first formalize the key–value pair \(KVP\) extraction task, then detail the evaluated models, prompting strategy, and output canonicalization\. Finally, we specify datasets, input regimes, and inference settings to ensure reproducibility and controlled comparison\.
### 3\.1Task Formulation
Given a document imageII, an OCR engine produces a textual transcriptTT, which may contain character errors, token fragmentation, and loss of structural ordering\. The KVP extraction task aims to map this text into a structured set of semantic fields:
𝒫=\{\(ki,vi\)\}i=1N,\\mathcal\{P\}=\\\{\(k\_\{i\},v\_\{i\}\)\\\}\_\{i=1\}^\{N\},wherekik\_\{i\}denotes a semantic key \(e\.g\.,TOTAL,DATE\) andviv\_\{i\}is its corresponding value\.
Compared to standard sequence labeling tasks such as named entity recognition, KVP extraction introduces additional challenges\. Keys may be implicit, values may span multiple lines, and multiple candidate values may exist for a single key \(e\.g\., subtotal vs\. total\)\. OCR further complicates the task by introducing numeric corruption, missing punctuation, and inconsistent token boundaries\. In form\-like documents, flattening spatial layout into text can also obscure relationships between semantically linked fields\.
### 3\.2Models Evaluated
We evaluate six instruction\-tuned, decoder\-only open\-source LLMs spanning the Gemma, Mistral, Qwen2\.5, DeepSeek, and LLaMA 3 families\. These models were selected to represent a range of parameter scales, context lengths, and tokenizer designs while maintaining a fully reproducible evaluation\.
Table[1](https://arxiv.org/html/2609.17538#S3.T1)summarizes the evaluated models\.
Table 1:Summary of evaluated LLMs\.These factors are relevant for document extraction\. Parameter scale affects semantic reasoning capacity, context length determines whether long receipts can be processed without truncation, and tokenizer design influences robustness to OCR artifacts such as broken numbers and irregular spacing\.
### 3\.3Prompting Strategy
A unified, dataset\-agnostic prompt is used across all models\. The prompt \(i\) defines the extraction task, \(ii\) enforces a JSON output schema, and \(iii\) explicitly discourages hallucinated fields\.
The same prompting framework and JSON output constraints are applied across all datasets\. While the overall prompt structure is shared, minor dataset\-specific wording is introduced only when required by differences in annotation schema \(e\.g\., the limited field inventory in SROIE\)\. Models must infer the relevant keys directly from the input text, ensuring that performance reflects semantic extraction ability rather than memorization of dataset\-specific field inventories\.
For prompt sensitivity analysis, we evaluate 0–3 in\-context examples\. Few\-shot examples are drawn from the training split of the same dataset but are strictly disjoint from evaluation samples\.
### 3\.4Output Canonicalization
Model outputs frequently deviate from valid JSON formatting, especially under noisy inputs\. To enable consistent evaluation, we apply a deterministic, non\-semantic output parsing and normalization procedure\.
We first attempt to parse a valid JSON object from the raw model output\. If this fails, we apply a lightweight output\-recovery step that only reads already\-generated ”key” and ”value” fields from the model response\. This step operates solely on the generated text, does not inspect the source document again, and does not introduce new content, semantic inference, rule\-based extraction, or task\-specific heuristics\.
If no structured output can be recovered, the prediction is treated as empty\.
This design ensures that evaluation reflects model generation behavior rather than post\-processing heuristics\.
Importantly, no post\-processing step extracts information from the input document; all recovered key–value pairs originate strictly from the model\-generated output\.
### 3\.5Datasets and Splits
Experiments are conducted on three standard document understanding benchmarks:
- •FUNSD\(forms with key–value annotations\),
- •CORD\(long, itemized receipts\),
- •SROIE\(structured receipts with a limited field schema\)\.
We use the official test splits for FUNSD and CORD\. For SROIE, we evaluate on the full dataset due to the absence of an official split\. These datasets collectively capture diverse structural properties, including spatially dependent forms and long, repetitive receipts\.
### 3\.6Input Regimes
Each model is evaluated under two input regimes:
Gold\-text:text derived from ground\-truth annotations, representing an OCR\-free evaluation setting\.
OCR\-text:text generated using PaddleOCR, EasyOCR, and Tesseract, capturing varying levels of realistic noise\.
This separation allows us to isolate semantic extraction performance from OCR robustness and quantify the effect of input degradation\.
### 3\.7Inference Settings
All models are evaluated under identical deterministic decoding settings: greedy decoding, no sampling, and a maximum generation length of 256 tokens\.
Models are invoked using their standard chat templates when applicable\. No model\-specific prompt tuning, decoding adjustments, or reranking is applied\. This ensures that differences in performance arise from model behavior rather than inference\-time optimization\.
### 3\.8Implementation Details
All experiments are implemented using thetransformerslibrary within a unified pipeline\. Each document is processed independently, and predictions are stored in JSONL format\.
All components of the pipeline—prompting, decoding, and evaluation—are fixed across models and input regimes, enabling controlled and reproducible comparison\.
Evaluation metrics and matching procedures are described in Section[4](https://arxiv.org/html/2609.17538#S4)\.
## 4Evaluation Methodology
This section defines the evaluation protocol used to assess key–value pair \(KVP\) extraction performance\. Our goal is to measure how accurately models recover annotated fields from document text under both clean and OCR\-degraded conditions\.
### 4\.1Evaluation Overview
Each document is provided as plain text, and the model generates a set of predicted key–value pairs in JSON format\. Predictions are compared against ground\-truth annotations using complementary metrics that capture: \(i\) coverage of annotated fields, \(ii\) exact correctness of extracted pairs, and \(iii\) robustness to textual variation\.
The evaluation is performed in a text\-only setting without access to layout or visual features, reflecting deployment scenarios where only OCR text is available\.
### 4\.2Task Definition
Let the ground\-truth set of key–value pairs be
𝒫=\{\(ki,vi\)\}i=1N,\\mathcal\{P\}=\\\{\(k\_\{i\},v\_\{i\}\)\\\}\_\{i=1\}^\{N\},and the model prediction be𝒫^\\hat\{\\mathcal\{P\}\}\.
Evaluation is restricted to annotated keys in𝒫\\mathcal\{P\}\. Predicted pairs whose keys do not match any ground\-truth key are ignored and do not affect the metrics\. This design avoids penalizing models for extracting plausible but unannotated fields, while ensuring comparability across models\.
### 4\.3Normalization and Matching
To reduce sensitivity to superficial formatting differences, both keys and values are normalized prior to comparison\. Normalization consists of: \(i\) lowercasing, \(ii\) trimming leading/trailing whitespace, and \(iii\) collapsing repeated spaces\.
##### Key Matching\.
Keys are matched using exact equality after normalization\.
##### Value Alignment\.
For each matched key, the corresponding predicted and ground\-truth values are aligned\. Value comparison is performed at the token level using whitespace\-based tokenization after normalization\.
### 4\.4Metrics
We report three complementary metrics\.
##### Key Recall\.
LetK^\\hat\{K\}denote the set of predicted keys\. Key Recall measures the fraction of ground\-truth keys that are successfully identified:
KeyRecall=\|\{k∈𝒫:k∈K^\}\|N\.\\text\{KeyRecall\}=\\frac\{\|\\\{k\\in\\mathcal\{P\}:k\\in\\hat\{K\}\\\}\|\}\{N\}\.
##### Exact Match \(EM\)\.
A key–value pair is counted as correct only if both the key and its value match exactly after normalization:
EM=\|\{\(k,v\)∈𝒫:\(k,v\)exactly matched\}\|N\.\\text\{EM\}=\\frac\{\|\\\{\(k,v\)\\in\\mathcal\{P\}:\(k,v\)\\text\{ exactly matched\}\\\}\|\}\{N\}\.This provides a strict measure of extraction accuracy\.
##### Value F1\.
For each matched key, we compute token\-level precision, recall, and F1 between predicted and ground\-truth values:
Precision=\|Vpred∩Vgt\|\|Vpred\|,Recall=\|Vpred∩Vgt\|\|Vgt\|,\\text\{Precision\}=\\frac\{\|V\_\{\\text\{pred\}\}\\cap V\_\{\\text\{gt\}\}\|\}\{\|V\_\{\\text\{pred\}\}\|\},\\quad\\text\{Recall\}=\\frac\{\|V\_\{\\text\{pred\}\}\\cap V\_\{\\text\{gt\}\}\|\}\{\|V\_\{\\text\{gt\}\}\|\},F1=2⋅Precision⋅RecallPrecision\+Recall\.F1=\\frac\{2\\cdot\\text\{Precision\}\\cdot\\text\{Recall\}\}\{\\text\{Precision\}\+\\text\{Recall\}\}\.
The final Value F1 score for a document is computed as the average over all matched keys\. Keys that are not predicted contribute zero to the average\.
This metric provides partial credit when predicted values capture most of the ground\-truth content despite minor formatting differences or OCR\-induced noise\.
##### Metric Complementarity\.
The three metrics capture distinct aspects of performance: Key Recall measures field detection, EM captures strict correctness, and Value F1 measures approximate value recovery under noise\.
### 4\.5Macro Averaging
Dataset\-level scores are computed using macro averaging:
MacroAverage=1M∑i=1MMetric\(i\),\\text\{MacroAverage\}=\\frac\{1\}\{M\}\\sum\_\{i=1\}^\{M\}\\text\{Metric\}\(i\),whereMMis the number of documents\. This ensures that each document contributes equally, preventing long or densely annotated documents from dominating the results\.
### 4\.6Evaluation Tracks
Models are evaluated under two input regimes:
Gold\-text track\.Inputs consist of clean text derived from ground\-truth annotations, providing an idealized evaluation setting without OCR errors\.
Noisy OCR track\.Inputs are generated using PaddleOCR, EasyOCR, and Tesseract, introducing realistic errors such as token fragmentation, numeric corruption, and loss of structure\.
Comparing these tracks isolates the effect of OCR noise on extraction quality\.
### 4\.7Evaluation Design
Our evaluation protocol is designed to reflect realistic document extraction rather than exact string reproduction\.
First, we ignore predicted keys that do not match annotated fields\. This avoids penalizing models for generating additional plausible fields outside the annotation schema, which is particularly important for datasets such as SROIE where annotations capture only a subset of the information present in each document\.
Second, we use token\-level Value F1 instead of strict string matching to better accommodate minor OCR\-induced variations while still penalizing substantial errors\. Together, these design choices produce a more robust and practically meaningful assessment of semantic value extraction under realistic OCR conditions\.
### 4\.8Reproducibility
All evaluation results are produced using a unified pipeline with fixed normalization, matching, and scoring procedures\. Per\-document predictions are stored in JSONL format, enabling full reproducibility and detailed error analysis\.
Implementation details are provided in Appendix[A](https://arxiv.org/html/2609.17538#A1)\.
## 5Results
This section presents quantitative and qualitative results for all evaluated models across the three datasets \(FUNSD, SROIE, CORD\) and the two evaluation tracks: \(1\) Gold\-text and \(2\) Noisy OCR Text\. We report Key Recall, Exact Match \(EM\), and Value F1 following the protocol in Section[4](https://arxiv.org/html/2609.17538#S4)\.
### 5\.1Overall Trends
Across datasets and input regimes, three broad empirical patterns recur\.
##### Strong zero\-shot performance\.
Across the three datasets, Qwen2\.5–7B, Mistral–7B, and LLaMA–3 8B are consistently among the strongest 0\-shot performers, particularly under Gold\-text conditions\. In Table[6](https://arxiv.org/html/2609.17538#S5.T6), Qwen2\.5–7B achieves the best 0\-shot Gold\-text Value F1 on all three datasets, and it also provides the best 0\-shot PaddleOCR result on FUNSD, SROIE, and CORD\.
##### Performance degradation under OCR is driven primarily by value corruption and key–value misalignment rather than failure to detect relevant fields\.
Across all datasets, the transition from Gold\-text to OCR text results in lower EM and Value F1\. Using the best\-performing 0\-shot model in each setting \(Table[6](https://arxiv.org/html/2609.17538#S5.T6)\), Value F1 decreases from 0\.6371 to 0\.5781 on FUNSD, from 0\.9262 to 0\.8964 on SROIE, and from 0\.9700 to 0\.8267 on CORD under PaddleOCR\. Under EasyOCR and Tesseract, the decline is substantially larger\.
##### Model gaps narrow as OCR noise increases\.
Under Gold\-text conditions, differences between models are more clearly separated, especially on SROIE and CORD\. Under noisier OCR inputs, these gaps become smaller\. This pattern is most visible on CORD under Tesseract, where all models fall below 0\.30 Value F1\.
These trends appear across forms \(FUNSD\), short receipts \(SROIE\), and long item\-heavy receipts \(CORD\), despite their differing structural properties\.
### 5\.2Comparison to Prior Work
We compare the results of this benchmark with representative prior work in two categories: \(i\) supervised document information extraction models evaluated using entity\-level F1, and \(ii\) LLM/MLLM\-based document understanding systems evaluated using ANLS\. Because these evaluation protocols differ from our Key Recall, Exact Match \(EM\), and Value F1 metrics, the reported results should be interpreted as reference baselines rather than directly comparable performance\.
##### Supervised layout\-aware baselines \(entity\-level F1\)\.
Prior supervised approaches such as the LayoutLM family, UDOP, FormNet, and DocFormer are trained end\-to\-end on dataset\-specific annotations and typically leverage layout cues and document structure\[[30](https://arxiv.org/html/2609.17538#bib.bib6),[31](https://arxiv.org/html/2609.17538#bib.bib7),[8](https://arxiv.org/html/2609.17538#bib.bib8),[25](https://arxiv.org/html/2609.17538#bib.bib32),[15](https://arxiv.org/html/2609.17538#bib.bib10),[2](https://arxiv.org/html/2609.17538#bib.bib9)\]\. As a result, they provide strong supervised reference baselines for comparison\. Tables[2](https://arxiv.org/html/2609.17538#S5.T2)–[4](https://arxiv.org/html/2609.17538#S5.T4)report representative entity\-level F1 results on the official test splits\. We use these as reference baselines rather than direct comparisons\.
Table 2:Representative supervised document understanding baselines on FUNSD \(entity\-level F1 on the official test split\)\. These models are fully supervised and leverage layout and/or visual features; they serve as supervised reference baselines rather than direct comparisons\.Table 3:Representative supervised baselines on CORD \(entity\-level F1 on the official test split\)\. These results reflect fully supervised training with layout\-aware architectures and serve as supervised reference baselines\.Table 4:Representative supervised baselines on SROIE \(entity\-level F1 on the official test split\)\.
##### LLM/MLLM baselines reported with ANLS\.
Recent LLM/MLLM document understanding systems typically report ANLS\. We therefore include these results as reference points rather than direct comparisons because our evaluation protocol uses different metrics\. Table[5](https://arxiv.org/html/2609.17538#S5.T5)lists representative zero\-shot ANLS values reported in LayoutLLM\[[17](https://arxiv.org/html/2609.17538#bib.bib15)\]\.
Table 5:Zero\-shot LLM and MLLM baselines reported with ANLS on FUNSD, CORD, and SROIE \(official test splits\)\. All values are taken from LayoutLLM and are included as reference baselines for comparison\.
##### Takeaway for comparisons\.
We interpret supervised entity\-level F1 results as reference baselines and ANLS results as additional reference points\. Our primary contribution is not to outperform these systems under their native protocols, but to provide a controlled benchmark of prompt\-only LLM extraction across Gold\-text and multiple OCR regimes on the official test sets of FUNSD, SROIE, and CORD\.
Table 6:Best 0\-shot Value F1 per dataset and regime\. For each setting, we report the strongest 0\-shot model using Gold\-text or PaddleOCR \(best\-performing OCR engine\)\.
### 5\.3FUNSD \(Gold\-Text\)
FUNSD Gold\-text isolates model ability to infer key–value relationships from clean, human\-annotated text without OCR distortion\. Results are shown in Table[7](https://arxiv.org/html/2609.17538#S5.T7)\.
Table 7:FUNSD \(Gold\-text\): Key–Value Extraction Results\.##### Observations\.
On FUNSD Gold\-text, the gap between Key Recall and Exact Match remains visible for all models, indicating that retrieving candidate fields is easier than correctly aligning their corresponding values\. Qwen2\.5–7B achieves the strongest overall results, particularly in Value F1\. Gemma–7B and LLaMA–3 8B form the next strongest group, while Gemma–2B and DeepSeek–7B remain substantially lower on all three metrics\.
Many remaining errors involve mismatches between question and answer spans, which is consistent with the form\-based structure of FUNSD after conversion to plain text\.
##### Effect of few\-shot prompting\.
To study prompt sensitivity under idealized conditions, we vary the number of in\-context examples from 0 to 3 for a subset of models\. Results are given in Table[8](https://arxiv.org/html/2609.17538#S5.T8)\.
Table 8:Few\-shot performance on FUNSD using Gold\-text\. Results are shown for 0–3 in\-context examples\.Few\-shot prompting yields substantial gains on FUNSD Gold\-text for both models\. LLaMA–3 8B improves steadily from 0\-shot to 3\-shot across all three metrics\. Qwen2\.5–7B also improves with additional examples, with its highest Key Recall and EM at 2\-shot and highest Value F1 at 3\-shot\.
Table 9:OCR error rates \(Character Error Rate, CER, and Word Error Rate, WER\) for FUNSD, SROIE, and CORD test sets\. Lower values indicate better OCR quality\. PaddleOCR consistently yields the lowest error rates across all datasets, while Tesseract produces the noisiest transcripts, particularly on long receipts \(CORD\)\.Table[9](https://arxiv.org/html/2609.17538#S5.T9)quantifies OCR severity across the three datasets using Character Error Rate \(CER\) and Word Error Rate \(WER\), computed against gold\-standard transcriptions\. Two patterns are especially important\. First, PaddleOCR consistently produces the cleanest transcripts, while Tesseract produces the most severe corruption\. Second, receipt\-style datasets, especially CORD, exhibit substantially higher error rates than FUNSD\. On CORD, Tesseract approaches a WER of 1\.0, indicating that nearly every word is either corrupted, deleted, or misplaced\.
### 5\.4FUNSD \(Noisy OCR\)
Applying OCR to FUNSD introduces distortions absent from the Gold\-text annotations\. As shown in Table[9](https://arxiv.org/html/2609.17538#S5.T9), PaddleOCR yields the lowest CER and WER on FUNSD, while EasyOCR and Tesseract produce substantially noisier transcripts\. Table[10](https://arxiv.org/html/2609.17538#S5.T10)summarizes Key Recall, EM, and Value F1 for all OCR–model combinations\.
Table 10:FUNSD \(Noisy OCR Text\): Key–Value extraction performance across OCR engines and models\. Results are grouped by OCR engine to highlight the impact of OCR quality on downstream LLM\-based extraction\.##### Observations\.
Under OCR inputs, all FUNSD results are lower than their Gold\-text counterparts\. Under PaddleOCR, Qwen2\.5–7B achieves the strongest results on all three metrics\. Under EasyOCR and Tesseract, Qwen2\.5–7B remains the strongest Value F1 model, while LLaMA–3 8B attains the highest Key Recall under Tesseract\.
The largest changes appear in EM and Value F1, which indicates that OCR noise affects value alignment more strongly than broad field detection\. The drop is especially pronounced under EasyOCR and Tesseract\.
##### Few\-shot robustness under PaddleOCR\.
We additionally probe the effect of few\-shot prompting on FUNSD PaddleOCR for LLaMA–3 8B and Qwen2\.5–7B using Table[11](https://arxiv.org/html/2609.17538#S5.T11)\.
Table 11:Few\-shot performance on FUNSD using PaddleOCR text\. Results are grouped by model to highlight prompt sensitivity under noisy OCR\.Under noisy OCR, few\-shot prompting still improves FUNSD performance for both models\. LLaMA–3 8B increases steadily from 0\-shot to 3\-shot across all three metrics\. Qwen2\.5–7B also improves overall, with a small dip at 2\-shot before reaching its highest values at 3\-shot\.
### 5\.5SROIE \(Gold\-text\)
Although SROIE contains only four annotated ground\-truth fields, real receipts contain many more semantically meaningful fields \(e\.g\., tax, subtotal, payment method\), so Key Recall is inherently shaped by the narrow evaluation schema\. Results on Gold\-text are shown in Table[12](https://arxiv.org/html/2609.17538#S5.T12)\.
Table 12:SROIE \(Gold\-text\): Key–Value extraction performance under clean, human\-annotated text\. Best results per metric are highlighted\.##### Observations\.
On SROIE Gold\-text, all strong models achieve very high Key Recall, while EM remains lower than Key Recall across the board\. Qwen2\.5–7B is the strongest overall model, followed by Mistral–7B and DeepSeek–7B\. Gemma–2B remains competitive in Value F1 relative to some larger models, despite lower EM\.
Because SROIE contains only four annotated fields, the reported metrics reflect performance on a narrow schema rather than the full semantic content of each receipt\.
##### Few\-shot prompts on SROIE\.
Because SROIE contains short receipts with relatively stereotyped structure, it provides a useful setting for prompt sensitivity analysis\. We compare 0–3\-shot prompts for LLaMA–3 8B and Qwen2\.5–7B using Gold\-text in Table[13](https://arxiv.org/html/2609.17538#S5.T13)\.
Table 13:Few\-shot prompting on SROIE \(Gold\-text\)\. Results for LLaMA–3 8B and Qwen2\.5–7B under 0–3\-shot prompting\.Few\-shot prompting is highly effective on SROIE Gold\-text\. Both LLaMA–3 8B and Qwen2\.5–7B improve substantially over their already strong 0\-shot baselines, with near\-perfect Key Recall and large gains in both EM and Value F1\. Performance remains strong across 1–3 shots for both models\.
### 5\.6SROIE \(Noisy OCR\)
SROIE OCR noise is substantially more severe than that observed in FUNSD, with frequent issues such as broken numeric fields \(e\.g\., “193\.00”→\\rightarrow“19300”\), corrupted decimal points, and address fragmentation across inconsistent line breaks\. As indicated by the SROIE rows in Table[9](https://arxiv.org/html/2609.17538#S5.T9), even the best OCR engine \(PaddleOCR\) operates at non\-trivial error rates, while EasyOCR and Tesseract introduce substantially more corruption\. Table[14](https://arxiv.org/html/2609.17538#S5.T14)summarizes results across OCR engines\.
Table 14:SROIE: Key–Value Extraction performance across OCR engines\. For each OCR regime, the strongest scores among evaluated models are highlighted\.##### Observations\.
Under OCR inputs, SROIE still yields relatively high Key Recall for the strongest models, but EM and Value F1 decrease compared with Gold\-text\. Qwen2\.5–7B achieves the strongest Value F1 under all three OCR engines and the strongest EM under PaddleOCR, EasyOCR, and Tesseract\. Mistral–7B and DeepSeek–7B remain competitive across engines\.
The reduction from Gold\-text to PaddleOCR is smaller on SROIE than on FUNSD or CORD, but the decline under EasyOCR and Tesseract remains clearly visible\.
### 5\.7CORD \(Gold\-text\)
CORD presents a more challenging scenario due to long receipts, dense item\-level content, and repeated numerical patterns\. Models frequently confuse item\-level amounts with global totals\. Results on Gold\-text are shown in Table[15](https://arxiv.org/html/2609.17538#S5.T15)\. For CORD few\-shot prompting, the in\-context examples were drawn from the training split using receiptsreceipt\_00760,receipt\_00730, andreceipt\_00710\.
Table 15:CORD \(Gold\-text\): Key–Value Extraction Results\.##### Observations\.
On CORD Gold\-text, Value F1 is higher than on FUNSD or SROIE for all strong models\. Qwen2\.5–7B achieves the strongest overall results, followed by LLaMA–3 8B\. Gemma–2B remains well below the larger models, while Gemma–7B, Mistral–7B, and DeepSeek–7B form a middle group\.
The gap between Key Recall and EM remains present, indicating that some errors still arise from assigning values to the wrong receipt fields, especially in the presence of repeated numeric content\.
##### Few\-shot prompting on CORD \(Gold\-text\)\.
We further examine prompt sensitivity on CORD Gold\-text for Qwen2\.5–7B and LLaMA–3 8B in Table[16](https://arxiv.org/html/2609.17538#S5.T16)\.
Table 16:Few\-shot prompting on CORD \(Gold\-text\)\. Each model is listed once, with performance shown for 0–3 in\-context examples\.On CORD Gold\-text, few\-shot prompting improves both models relative to 0\-shot\. The largest gains occur between 0\-shot and 1\-shot, after which performance saturates\. Qwen2\.5–7B remains slightly stronger than LLaMA–3 8B across most settings, although the gap narrows substantially under few\-shot prompting\.
### 5\.8CORD \(Noisy OCR\)
We next evaluate CORD under realistic OCR conditions using EasyOCR, PaddleOCR, and Tesseract\. As shown in Table[9](https://arxiv.org/html/2609.17538#S5.T9), CORD exhibits the highest OCR error rates among the three datasets, particularly under Tesseract\. Results are summarized in Table[17](https://arxiv.org/html/2609.17538#S5.T17)\.
Table 17:CORD: Key–Value Extraction Performance Across OCR Engines\. Each OCR engine is listed once, with results shown for all evaluated models\.Table 18:Few\-shot prompting on CORD using PaddleOCR text\. Each model is listed once, with performance shown for 0–3 shot prompts\.##### Few\-shot prompting under PaddleOCR \(CORD\)\.
On CORD PaddleOCR text, few\-shot prompting yields moderate but noticeable gains over the already strong 0\-shot baselines\. For Qwen2\.5–7B, Value F1 improves from 0\.8267 to 0\.8618 at 2\-shot, while LLaMA–3 8B rises from 0\.7547 to 0\.8489 at 3\-shot\.
##### Observations\.
CORD under OCR yields the lowest results among the three datasets under the same OCR engines, especially under Tesseract\. Qwen2\.5–7B remains the strongest model across all three OCR settings, with LLaMA–3 8B usually closest under EasyOCR and PaddleOCR\. Under Tesseract, however, all models fall sharply, and the differences between them narrow\.
The gap between PaddleOCR and Tesseract is especially large on CORD\. For example, Qwen2\.5–7B drops from 0\.8267 Value F1 under PaddleOCR to 0\.2679 under Tesseract\.
### 5\.9Prompt Sensitivity and Saturation Effects
Across datasets, few\-shot prompting provides gains that depend strongly on both document type and input quality\. On CORD Gold\-text and CORD PaddleOCR, additional examples generally improve performance before saturating\. On FUNSD, both Gold\-text and PaddleOCR settings benefit from few\-shot prompting, with the strongest results typically reached at 2–3 shots\. On SROIE, few\-shot prompting is especially effective and remains stable across 1–3 shots under both Gold\-text and PaddleOCR inputs\.
These results indicate that the effect of in\-context examples depends on both dataset structure and input quality\. The gains are largest on the more regular receipt datasets and remain visible, though smaller, under OCR inputs\.
### 5\.10Cross\-Dataset Comparison
Comparing behavior across FUNSD, SROIE, and CORD highlights that each dataset stresses a different part of the extraction pipeline\. On FUNSD, errors are driven primarily by semantic ambiguity and the loss of layout structure after OCR flattening\. Models must infer relationships between loosely related “question” and “answer” spans without spatial cues, which tends to inflate the gap between Key Recall and EM\.
In SROIE, noisy vendor names, addresses, and numeric corruption dominate the error profile\. Even strong models such as Qwen2\.5 and Mistral experience clear drops in EM and Value F1 relative to Gold\-text, although the compact and regular receipt schema makes this dataset more amenable to few\-shot prompting\.
CORD exposes a different failure mode: distinguishing line items from global receipt fields when values repeat across the document\. Models often attach the correct key \(e\.g\.,total\) to an item\-level amount rather than the global total, producing substantial EM penalties even when Key Recall remains relatively high\.
Taken together, these differences show that KVP extraction cannot be adequately assessed on a single benchmark\. Forms, short receipts, and long item\-heavy receipts reveal distinct semantic and structural failure modes\.
FUNSD\-GoldFUNSD\-OCRSROIE\-GoldSROIE\-OCRCORD\-GoldCORD\-OCR00\.50\.5110\.640\.640\.580\.580\.930\.930\.90\.90\.970\.970\.830\.83Value F1Best model per settingFigure 4:Best 0\-shot Value F1 achieved in each dataset and regime\. For each bar, we report the strongest 0\-shot model under Gold\-text or PaddleOCR\. The Gold\-to\-OCR gap is smallest on SROIE and largest on CORD, highlighting that OCR degradation affects datasets differently depending on structural complexity and numeric density\.Figure[4](https://arxiv.org/html/2609.17538#S5.F4)aggregates the strongest 0\-shot Value F1 achieved in each dataset and regime\. Even when selecting the best\-performing model per condition, the degradation from Gold\-text to OCR remains visible: FUNSD drops by roughly 6 points, SROIE by about 3 points, and CORD by about 14 points under PaddleOCR alone\.
### 5\.11Qualitative Error Analysis
To complement the quantitative results, we present representative qualitative examples that illustrate how model behavior changes across clean\-text and OCR\-degraded inputs\. Table[19](https://arxiv.org/html/2609.17538#S5.T19)shows selected predictions highlighting both successful extraction and common failure modes\. These examples correspond directly to the failure categories summarized in Table[20](https://arxiv.org/html/2609.17538#S5.T20)\.
Table 19:Qualitative examples of LLM\-based KVP extraction across datasets and input regimes\. We show representative success and failure cases, highlighting the impact of OCR noise and structural ambiguity\.Under clean\-text conditions, models typically recover key–value pairs with correct alignment and formatting\. In these cases, both Exact Match and Value F1 are high, reflecting accurate semantic mapping from input text to structured output\.
In contrast, OCR\-degraded inputs introduce systematic failure modes that are not fully captured by aggregate metrics\. Three recurring patterns are evident: numeric corruption, key–value misalignment, and hallucination or over\-extraction\.
Numeric corruption\.OCR errors frequently distort numeric values, such as decimal points or digit boundaries\. These errors often preserve partial token overlap, resulting in moderate Value F1 but complete failure under Exact Match\.
Key–value misalignment\.Models often identify the correct set of keys but associate them with incorrect values\. This is particularly common in form\-like documents such as FUNSD, where spatial relationships between fields are lost in flattened text\.
Hallucination and over\-extraction\.Models sometimes generate additional fields that are not supported by the input text, especially in receipt\-style documents\. These hallucinated outputs reflect implicit schema priors induced by the prompt or pretraining data\.
More broadly, these examples illustrate that OCR noise does not merely reduce value accuracy, but fundamentally alters the structure of the extraction task\. Errors in token integrity, line ordering, and grouping disrupt the cues that models rely on for semantic alignment\.
Table 20:Common failure modes in LLM\-based KVP extraction\.A manual examination of several hundred model predictions across FUNSD, SROIE, and CORD reveals systematic failure patterns that explain much of the remaining gap between LLM extraction and specialized document models\.
One prominent failure mode is*hallucination*, where models generate keys or values not present in the document\. This is most common on receipts, where models sometimes invent fields such as “subtotal” or “invoice number” based on prior expectations\. Hallucinations introduce false positives and directly degrade EM\.
A second recurring issue is*key–value misalignment*\. Models often identify the correct key inventory but attach incorrect values, particularly in dense numerical regions such as tax, total, and item\-price sections\. Without layout information, models appear to rely on local textual proximity or distributional regularities that are not always semantically correct\.
A third class of errors involves*address fragmentation*\. Multi\-line addresses are often truncated, split, or merged with neighboring text, reducing Value F1 and harming downstream usability\. OCR artifacts make this especially difficult by breaking line structure\.
Models also exhibit*over\-extraction*, especially on long receipts, where they attempt to assign labels to nearly every number in the document\. Finally, a non\-trivial fraction of errors arise from*JSON formatting problems*, including unbalanced braces, multiple JSON blocks, or explanatory text mixed with structured output\.
LLM KVPFailure ModesHallucinatedkeys/valuesKey–valuemisalignmentAddressfragmentationOver\-extractionJSON / formaterrorsFigure 5:Conceptual taxonomy of recurring failure modes\. Hallucinations and address fragmentation are strongly tied to OCR corruption and missing layout cues, while misalignment, over\-extraction, and JSON failures reflect limitations in structural reasoning and output control\.As summarized in Figure[5](https://arxiv.org/html/2609.17538#S5.F5), these errors can be grouped into five interrelated classes\. Hallucinations and address fragmentation are closely tied to OCR artifacts and missing layout cues, while misalignment connects directly to downstream over\-extraction and JSON failures\.
### 5\.12Summary of Results
Across datasets, strong 0\-shot performance is observed under Gold\-text conditions, especially for Qwen2\.5–7B and, in several settings, Mistral–7B and LLaMA–3 8B\. Under OCR inputs, EM and Value F1 decline across all datasets, with the largest absolute drop occurring on CORD and the smallest on SROIE under PaddleOCR\.
Few\-shot prompting generally improves results on all three datasets, although the magnitude of improvement varies by dataset and input regime\. The strongest few\-shot gains are observed on SROIE and FUNSD, while CORD shows steadier but smaller improvements before saturation\.
## 6Discussion
This benchmark reveals that text\-only LLM\-based key–value pair \(KVP\) extraction is governed by a two\-stage bottleneck: \(i\) semantic reasoning over textual content, and \(ii\) preservation of that content under OCR\-induced corruption\. While modern instruction\-tuned models perform strongly in the first stage, their overall effectiveness in realistic pipelines is ultimately constrained by the second\. This distinction clarifies why clean\-text evaluations often overestimate real\-world performance\.
### 6\.1Separation Between Semantic Capacity and Input Fidelity
Under Gold\-text conditions, several models achieve high Key Recall and Value F1 across all datasets, indicating that LLMs can recover a large fraction of annotated fields without task\-specific supervision or layout information\. This suggests that, when textual fidelity is preserved, extraction errors arise primarily from alignment and normalization rather than from insufficient semantic capacity\.
However, this regime does not reflect typical deployment settings\. Once OCR noise is introduced, the dominant source of error shifts away from reasoning and toward input corruption\. This transition highlights a key limitation of text\-only pipelines: strong semantic modeling cannot compensate for degraded or incomplete input signals\.
### 6\.2OCR Noise Alters the Structure of the Task
The effect of OCR noise extends beyond simple degradation in accuracy\. It fundamentally changes the structure of the extraction problem\. Under clean text, models operate on well\-formed sequences with clear lexical boundaries\. Under OCR inputs, token fragmentation, numeric corruption, and loss of ordering disrupt these cues\.
This shift is reflected in the disproportionate drop in EM and Value F1 relative to Key Recall\. Models often continue to identify relevant fields \(high recall\), but fail to correctly align keys with their corresponding values\. In this sense, OCR noise converts the problem from semantic extraction to a more fragile alignment task\.
Importantly, the impact of this shift is dataset\-dependent\. FUNSD suffers from loss of spatial relationships, SROIE from numeric corruption, and CORD from compounded ambiguity in dense numeric regions\. These differences indicate that OCR noise interacts with document structure, rather than acting as uniform random corruption\.
### 6\.3Scaling Effects Diminish Under Noisy Inputs
Increasing model size improves performance under Gold\-text conditions, but these gains diminish as OCR noise increases\. Under noisy inputs, model rankings compress and differences between architectures become less pronounced\.
This pattern suggests that scaling primarily enhances semantic reasoning, but provides limited benefit when the underlying signal is corrupted\. Larger models can partially compensate for minor inconsistencies, but cannot reliably recover information that has been removed or distorted upstream\. As a result, model capacity alone is insufficient to address the challenges posed by OCR\-heavy pipelines\.
### 6\.4Prompting Improves Performance Within Structural Limits
Few\-shot prompting consistently improves performance, but its effectiveness is bounded by input quality and dataset structure\. Gains are strongest on SROIE, where documents are short and the field inventory is limited, and more moderate on FUNSD and CORD, where structural ambiguity is higher\.
This suggests that in\-context examples primarily help models exploit regular patterns in the data rather than recover missing structure\. When OCR noise disrupts key spans or relationships, additional examples provide diminishing returns\. Thus, prompting is most effective when the task is ambiguous but the input remains structurally intact\.
### 6\.5Structural Limitations of Text\-Only Pipelines
A central limitation of this benchmark is the reliance on flattened text\. Many document understanding tasks depend on spatial relationships, hierarchical grouping, and visual context, which are lost when documents are converted to linear text sequences\.
The observed failure modes—key–value misalignment, hallucination, address fragmentation, and format instability—are consistent with this limitation\. These errors often arise not from incorrect reasoning, but from insufficient structural cues in the input representation\. This highlights a fundamental gap between text\-only LLM pipelines and layout\-aware or multimodal approaches\.
### 6\.6Positioning Relative to Layout\-Aware Models
The comparison with prior work suggests that text\-only LLMs and layout\-aware models address complementary aspects of document understanding\. Layout\-aware models leverage explicit spatial information and supervised training to achieve high accuracy on structure\-sensitive tasks\. In contrast, LLMs offer flexibility, schema generalization, and strong zero\-shot performance\.
Rather than viewing these approaches as competing paradigms, the results suggest that they are best understood as complementary components\. Hybrid systems that combine OCR, layout modeling, and LLM\-based semantic reasoning may offer the most robust solution for real\-world document extraction\.
### 6\.7Evaluation and Dataset Effects
The benchmark also highlights that evaluation outcomes depend strongly on dataset design\. In SROIE, the limited annotation schema constrains the maximum achievable recall and does not reward extraction of additional valid fields\. In FUNSD and CORD, structural complexity introduces ambiguity that is not fully captured by text\-only representations\.
Similarly, metric choice influences interpretation\. EM is highly sensitive to formatting deviations, while Value F1 provides a more tolerant measure under OCR noise but still depends on token\-level overlap\. These factors suggest that evaluation metrics should be interpreted in the context of both dataset characteristics and input quality\.
### 6\.8Implications for Deployment
From a practical perspective, these findings suggest that the reliability of LLM\-based extraction depends more on upstream data quality than on model choice alone\. Text\-only LLM pipelines are well suited to settings with clean or born\-digital text, where semantic reasoning dominates\. In contrast, OCR\-heavy pipelines require additional mechanisms for error correction, structural recovery, or validation\.
This does not diminish the utility of LLMs, but clarifies their role within a larger system\. They are most effective as semantic interpreters operating on high\-quality inputs, rather than as standalone solutions for noisy document processing\.
### 6\.9Key Takeaways
Three conclusions emerge\. First, modern LLMs exhibit strong semantic extraction capability under clean\-text conditions\. Second, OCR noise fundamentally alters the extraction task and becomes the dominant source of error in realistic settings\. Third, improvements from scaling and prompting are conditional on the availability of reliable input signals\.
Overall, progress in document understanding will require not only advances in LLMs, but also improvements in OCR robustness, structural representation, and evaluation protocols that reflect real\-world conditions\.
## 7Conclusion and Future Work
We presented a controlled benchmark of open\-source instruction\-tuned large language models for key–value pair \(KVP\) extraction under both clean\-text and OCR\-degraded input conditions\. By evaluating representative decoder\-only models \(Gemma, Mistral, Qwen2\.5, LLaMA 3, and DeepSeek\) across FUNSD, CORD, and SROIE using a unified protocol, this work isolates the interaction between semantic modeling capacity and input quality in text\-only extraction pipelines\.
Our results demonstrate that modern instruction\-tuned LLMs possess strong semantic extraction capabilities when the textual signal is preserved\. Under Gold\-text conditions, models recover a large fraction of annotated fields without task\-specific training, indicating that prompt\-based inference alone is often sufficient for structured extraction in clean settings\. However, this capability does not fully transfer to realistic scenarios\.
Across all datasets, OCR\-induced corruption consistently reduces Exact Match and Value F1, with the largest degradation observed in structurally complex and numerically dense documents such as CORD\. More importantly, the results show that OCR noise does not simply lower performance, but shifts the dominant error regime from semantic inference to key–value alignment and value corruption\. This establishes a clear two\-stage bottleneck: while LLMs are effective semantic interpreters, their performance is ultimately constrained by the fidelity of the input text\.
We further observe that scaling and prompting provide conditional improvements\. Larger models yield stronger results when the input signal remains intact, but their relative advantage diminishes as OCR noise increases\. Similarly, few\-shot prompting improves performance across datasets, but its effectiveness depends on the availability of consistent structural patterns and saturates quickly in noisy settings\. These findings suggest that neither scaling nor prompting alone can overcome upstream degradation\.
From a system perspective, these results position text\-only LLM extraction as a powerful but incomplete solution for document understanding\. While these models offer strong zero\- and few\-shot generalization, they lack explicit access to spatial structure and remain sensitive to OCR\-induced errors\. As a result, robust real\-world pipelines will likely require integration with complementary components rather than relying on prompt\-based extraction in isolation\.
A central contribution of this work is reproducibility\. We introduce a standardized evaluation framework with unified prompting, deterministic decoding, non\-semantic output canonicalization, and consistent benchmarking across datasets and OCR engines\. This enables controlled comparison across models and input regimes and provides a foundation for future research on robust document extraction\.
##### Future Directions\.
Our findings suggest several promising directions for further work\.
Hybrid document understanding systems\.Combining layout\-aware encoders or vision–language models with LLM\-based semantic decoders may provide a principled way to integrate structural and semantic information, improving robustness on complex documents\.
Robustness to OCR degradation\.Improving performance under noisy inputs remains a key challenge\. Future work could explore OCR post\-correction, numeric repair, structure recovery, and noise\-aware adaptation strategies that explicitly account for corrupted inputs\.
Structure\-aware prompting and decoding\.While few\-shot prompting is effective, its benefits are bounded\. Incorporating schema constraints, structured decoding, or output regularization may improve stability without relying on heuristic post\-processing\.
Evaluation beyond clean benchmarks\.Current benchmarks do not fully capture deployment conditions\. Expanding annotation schemas, incorporating more diverse document types, and evaluating under controlled degradation levels would enable more realistic assessment of document extraction systems\.
Bridging clean and noisy regimes\.A more systematic understanding of how performance degrades with input quality could help align model improvements with real\-world gains, particularly in OCR\-heavy pipelines\.
##### Final Remark\.
Overall, instruction\-tuned LLMs already provide strong semantic extraction capabilities when the input signal is intact\. Achieving reliable document understanding in practice, however, will require systems that jointly address language, structure, and input uncertainty, rather than treating these factors in isolation\.
## Appendix AHyperparameters and Implementation Details
This appendix provides implementation details necessary to ensure full reproducibility of our experiments\.
### A\.1Model Configurations
All models are evaluated using publicly available HuggingFace checkpoints:
- •google/gemma\-2b\-it
- •google/gemma\-7b\-it
- •mistralai/Mistral\-7B\-Instruct\-v0\.2
- •Qwen/Qwen2\.5\-7B\-Instruct
- •deepseek\-ai/deepseek\-llm\-7b\-chat
- •meta\-llama/Meta\-Llama\-3\-8B\-Instruct
All models are used in their instruction\-tuned variants without any fine\-tuning or parameter updates\.
### A\.2Decoding Parameters
All models are evaluated under identical deterministic decoding settings:
- •Decoding strategy: greedy decoding
- •Maximum generation length: 256 tokens
- •Temperature: 0\.0
- •Top\-pp: disabled
- •Sampling: disabled
These settings eliminate stochastic variation and ensure consistent outputs across runs\.
### A\.3Prompt Template
All models are evaluated using a unified prompt template consisting of:
- •Task instruction defining key–value extraction
- •Explicit JSON output requirement
- •Anti\-hallucination constraint
- •Optional few\-shot examples \(1–3\)
The same prompt structure is applied across all models and datasets to ensure fair comparison\. The full prompt template and examples are provided in the accompanying code repository\.
### A\.4OCR Engines
We evaluate three OCR systems:
- •PaddleOCR \(primary evaluation\)
- •EasyOCR
- •Tesseract
OCR outputs are used directly without any correction, filtering, or post\-processing\.
### A\.5Evaluation Pipeline
All predictions are processed using a deterministic JSON\-first output parsing pipeline\. We first attempt JSON parsing of the model response; if this fails, we recover only explicitly generated ”key” / ”value” fields from the response text itself\. No rule\-based extraction from the source document, heuristic completion, semantic correction, or post\-hoc field inference is applied\. Thus, all extracted content originates from the model output\.
Metrics \(Key Recall, Exact Match, Value F1\) are computed using a shared normalization and matching framework across all datasets\.
### A\.6Implementation Details
All experiments are implemented using thetransformerslibrary within a unified inference pipeline\.
Each document is processed independently, and model outputs are stored in JSONL format to support reproducibility and downstream analysis\.
### A\.7Hardware Setup
All experiments are conducted on a single\-GPU environment \(e\.g\., Colab Pro\+\)\. Models in the 7–8B parameter range are evaluated sequentially to ensure consistent resource usage\.
For larger models, CPU offloading is used when necessary, which may increase inference latency but does not affect output quality\.
## References
- \[1\]AI@Meta\(2024\)The llama 3 herd of models\.arXiv preprint arXiv:2407\.21783\.Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p2.1),[§1](https://arxiv.org/html/2609.17538#S1.p6.1),[§2\.3](https://arxiv.org/html/2609.17538#S2.SS3.p1.1)\.
- \[2\]S\. Appalarajuet al\.\(2021\)DocFormer: end\-to\-end transformer for document understanding\.InICCV,Cited by:[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p2.1),[§5\.2](https://arxiv.org/html/2609.17538#S5.SS2.SSS0.Px1.p1.1),[Table 2](https://arxiv.org/html/2609.17538#S5.T2.4.8.7.3),[Table 3](https://arxiv.org/html/2609.17538#S5.T3.4.6.5.3)\.
- \[3\]DeepSeek\-AIet al\.\(2024\)DeepSeek llm\.arXiv preprint arXiv:2401\.02954\.Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p6.1),[§2\.3](https://arxiv.org/html/2609.17538#S2.SS3.p1.1)\.
- \[4\]J\. Devlin, M\. Chang, K\. Lee, and K\. Toutanova\(2019\)BERT: pre\-training of deep bidirectional transformers for language understanding\.NAACL\.Cited by:[Table 2](https://arxiv.org/html/2609.17538#S5.T2.4.2.1.3),[Table 3](https://arxiv.org/html/2609.17538#S5.T3.4.2.1.3)\.
- \[5\]Y\. Duet al\.\(2020\)PP\-ocr: a practical ultra lightweight ocr system\.arXiv preprint arXiv:2009\.09941\.Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p4.1),[§2\.4](https://arxiv.org/html/2609.17538#S2.SS4.p2.1)\.
- \[6\]J\. Ha, R\. M\. Haralick, and I\. T\. Phillips\(2000\)Document analysis and understanding for paper\-based forms\.InDocument Analysis Systems Workshop,Cited by:[§2\.1](https://arxiv.org/html/2609.17538#S2.SS1.p1.1)\.
- \[7\]T\. Honget al\.\(2022\)BROS: a pre\-trained language model focusing on text and layout for better key information extraction\.InAAAI,Cited by:[Table 2](https://arxiv.org/html/2609.17538#S5.T2.4.7.6.3)\.
- \[8\]Y\. Huanget al\.\(2022\)LayoutLMv3: unified text and image masking for document ai\.arXiv preprint arXiv:2204\.08387\.Cited by:[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p1.1),[§5\.2](https://arxiv.org/html/2609.17538#S5.SS2.SSS0.Px1.p1.1),[Table 2](https://arxiv.org/html/2609.17538#S5.T2.4.5.4.3),[Table 3](https://arxiv.org/html/2609.17538#S5.T3.4.5.4.3)\.
- \[9\]Z\. Huang, L\. Gao, L\. Liu,et al\.\(2019\)ICDAR 2019 competition on scanned receipt ocr and information extraction\.InICDAR Workshops,Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p1.1),[§1](https://arxiv.org/html/2609.17538#S1.p4.1),[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p2.1)\.
- \[10\]Jaided AI\(2020\)EasyOCR\.Note:[https://github\.com/JaidedAI/EasyOCR](https://github.com/JaidedAI/EasyOCR)Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p4.1),[§2\.4](https://arxiv.org/html/2609.17538#S2.SS4.p2.1)\.
- \[11\]G\. Jaume, H\. K\. Ekenel, and J\. Thiran\(2019\)FUNSD: a dataset for form understanding in noisy scanned documents\.InICDAR Workshops,Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p1.1),[§1](https://arxiv.org/html/2609.17538#S1.p4.1),[§2\.1](https://arxiv.org/html/2609.17538#S2.SS1.p2.1),[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p2.1)\.
- \[12\]A\. Q\. Jianget al\.\(2023\)Mistral 7b\.arXiv preprint arXiv:2310\.06825\.Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p2.1),[§1](https://arxiv.org/html/2609.17538#S1.p6.1),[§2\.3](https://arxiv.org/html/2609.17538#S2.SS3.p1.1)\.
- \[13\]A\. R\. Kattiet al\.\(2018\)Chargrid: understanding 2d documents\.InEMNLP,Cited by:[§2\.1](https://arxiv.org/html/2609.17538#S2.SS1.p2.1)\.
- \[14\]G\. Kimet al\.\(2022\)OCR\-free document understanding transformer\.InECCV,Cited by:[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p4.1)\.
- \[15\]J\. Leeet al\.\(2021\)FormNet: structural encoding for form understanding\.InEMNLP,Cited by:[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p2.1),[§5\.2](https://arxiv.org/html/2609.17538#S5.SS2.SSS0.Px1.p1.1),[Table 2](https://arxiv.org/html/2609.17538#S5.T2.4.9.8.3),[Table 3](https://arxiv.org/html/2609.17538#S5.T3.4.7.6.3)\.
- \[16\]Y\. Liet al\.\(2021\)StructuralLM: structural pre\-training for form understanding\.arXiv preprint arXiv:2105\.11210\.Cited by:[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p2.1)\.
- \[17\]C\. Luoet al\.\(2024\)LayoutLLM: layout instruction tuning for document understanding\.arXiv preprint arXiv:2404\.05225\.Cited by:[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p4.1),[§5\.2](https://arxiv.org/html/2609.17538#S5.SS2.SSS0.Px2.p1.1)\.
- \[18\]J\. Milleret al\.\(2021\)Transformer sensitivity to noise\.arXiv preprint arXiv:2106\.03930\.Cited by:[§2\.4](https://arxiv.org/html/2609.17538#S2.SS4.p1.1)\.
- \[19\]S\. Park, M\. Shin, B\. Lee, J\. Lee, J\. Surh, M\. Seo, and H\. Lee\(2019\)CORD: a consolidated receipt dataset for post\-ocr parsing\.InNeurIPS Document Intelligence Workshop,Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p4.1),[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p2.1)\.
- \[20\]Qwen Team\(2024\)Qwen2\.5 technical report\.arXiv preprint arXiv:2412\.15115\.Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p6.1),[§2\.3](https://arxiv.org/html/2609.17538#S2.SS3.p1.1)\.
- \[21\]M\. Shilman, J\. Liang, and R\. Haralick\(2005\)Structured document image analysis using prior knowledge and heuristics\.InICDAR,Cited by:[§2\.1](https://arxiv.org/html/2609.17538#S2.SS1.p1.1)\.
- \[22\]M\. Shpigel Nacsonet al\.\(2024\)DocVLM: efficient vision\-language model for documents\.arXiv preprint arXiv:2412\.08746\.Cited by:[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p4.1)\.
- \[23\]R\. Smith\(2007\)An overview of the tesseract ocr engine\.InICDAR,Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p4.1),[§2\.4](https://arxiv.org/html/2609.17538#S2.SS4.p2.1)\.
- \[24\]H\. Sunet al\.\(2023\)LLM robustness under noisy text\.arXiv preprint arXiv:2305\.13289\.Cited by:[§2\.4](https://arxiv.org/html/2609.17538#S2.SS4.p1.1)\.
- \[25\]Z\. Tanget al\.\(2022\)UDOP: unified document processing\.arXiv preprint arXiv:2212\.02623\.Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p2.1),[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p2.1),[§5\.2](https://arxiv.org/html/2609.17538#S5.SS2.SSS0.Px1.p1.1),[Table 2](https://arxiv.org/html/2609.17538#S5.T2.4.10.9.3),[Table 3](https://arxiv.org/html/2609.17538#S5.T3.4.8.7.3)\.
- \[26\]G\. Teamet al\.\(2024\)Gemma: open models based on gemini research\.arXiv preprint arXiv:2403\.08295\.Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p2.1),[§1](https://arxiv.org/html/2609.17538#S1.p6.1),[§2\.3](https://arxiv.org/html/2609.17538#S2.SS3.p1.1)\.
- \[27\]X\. Wanget al\.\(2023\)InstructUIE: unified information extraction\.arXiv preprint arXiv:2304\.08085\.Cited by:[§1](https://arxiv.org/html/2609.17538#S1.p2.1),[§2\.3](https://arxiv.org/html/2609.17538#S2.SS3.p2.1)\.
- \[28\]Y\. Wanget al\.\(2022\)LiLT: a simple yet effective language\-independent layout transformer\.InACL,Cited by:[Table 2](https://arxiv.org/html/2609.17538#S5.T2.4.6.5.3)\.
- \[29\]J\. Weiet al\.\(2022\)Emergent abilities of large language models\.arXiv preprint arXiv:2206\.07682\.Cited by:[§2\.3](https://arxiv.org/html/2609.17538#S2.SS3.p2.1)\.
- \[30\]Y\. Xuet al\.\(2020\)LayoutLM: pre\-training of text and layout for document understanding\.InKDD,Cited by:[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p1.1),[§5\.2](https://arxiv.org/html/2609.17538#S5.SS2.SSS0.Px1.p1.1),[Table 2](https://arxiv.org/html/2609.17538#S5.T2.4.3.2.3),[Table 3](https://arxiv.org/html/2609.17538#S5.T3.4.3.2.3),[Table 4](https://arxiv.org/html/2609.17538#S5.T4.1.1.3),[Table 4](https://arxiv.org/html/2609.17538#S5.T4.2.2.3),[Table 4](https://arxiv.org/html/2609.17538#S5.T4.3.3.3)\.
- \[31\]Y\. Xuet al\.\(2021\)LayoutLMv2: multi\-modal pre\-training for visually\-rich documents\.InACL,Cited by:[§2\.2](https://arxiv.org/html/2609.17538#S2.SS2.p1.1),[§5\.2](https://arxiv.org/html/2609.17538#S5.SS2.SSS0.Px1.p1.1),[Table 2](https://arxiv.org/html/2609.17538#S5.T2.4.4.3.3),[Table 3](https://arxiv.org/html/2609.17538#S5.T3.4.4.3.3)\.Similar Articles
We benchmarked 18 LLMs on OCR (7k+ calls) — cheaper/old models oftentimes win. Full dataset + framework open-sourced. [R]
A comprehensive benchmark of 18 LLMs on OCR tasks (7k+ calls) reveals that cheaper and older models often match premium accuracy at a fraction of the cost, with full dataset and framework open-sourced.
Vision-capable LLMs vs. OCR for long-document (including charts, images, tables, etc.) QA
A benchmark comparing vision-capable LLMs (native PDF reading) against OCR-based pipelines on 30 long, image-heavy PDFs finds that OCR with layout extraction still outperforms vision models on chart/table-heavy pages and has a 0% failure rate vs. 7% for native PDF, though the sample size is small and many gaps are within noise.
Evaluating Structured Information Extraction with Open Models in a High Risk Public Sector Application
This paper benchmarks open-source OCR, LLM, and VLM systems for structured information extraction in a high-risk public sector application, finding that VLMs generally outperform OCR+LLM pipelines but most configurations struggle in zero-shot settings, emphasizing the critical role of input quality.
The Text Uncanny Valley: Non-Monotonic Performance Degradation in LLM Information Retrieval
This research paper investigates the 'Text Uncanny Valley,' a phenomenon where LLM performance in information retrieval tasks degrades non-monotonically as word-boundary corruption increases. The authors propose a mode transition hypothesis to explain this U-shaped performance curve and demonstrate its relevance to real-world noisy text inputs.
KhatianDoc: A Human-Verified Benchmark Diagnosing Multimodal LLM Failure on Bengali Legal Land Records
The paper introduces KhatianDoc, a human-verified benchmark for diagnosing multimodal LLM failures on Bengali legal land records, revealing that current models fail on tasks like symbol recognition and document QA.