PARSE: LLM Driven Schema Optimization for Reliable Entity Extraction

Structured information extraction from unstructured text is critical for emerging Software 3.0 systems where LLM agents autonomously interact with APIs and tools. Recent approaches apply large language models directly to extraction tasks using existing JSON schemas, often with constraint decoding or reinforcement learning approaches to ensure syntactic validity, but treat JSON schemas as static contracts designed for human developers, leading to suboptimal extraction performance, frequent hallucinations, and unreliable agent behavior when schemas contain ambiguous or incomplete specifications. We recognize that JSON schemas themselves are a form of natural language understanding contract that encodes rules, relationships, and expectations about data structure contracts that LLMs should be able to both interpret and systematically improve. Consequently, we develop PARSE (Parameter Automated Refinement and Schema Extraction), a novel system with two synergistic components: ARCHITECT, which autonomously optimizes JSON schemas for LLM consumption while maintaining backward compatibility through RELAY (an integrated code generation system), and SCOPE, which implements reflection-based extraction with combined static and LLM-based guardrails. We evaluate PARSE qualitatively and quantitatively on three datasets including Schema-Guided Dialogue (SGD), Structured Web Data Extraction (SWDE), and internal retail conversation data, and find that it achieves up to 64.7% improvement in extraction accuracy on SWDE with combined framework improvements reaching 10% across models, while reducing extraction errors by 92% within the first retry and and maintaining practical latency.

Paper

References (19)

Scroll for more · 7 remaining

Similar papers

Agents ingesting contracts, invoices and filings need nested JSON matching a caller-supplied schema, but 2026 extraction benchmarks report frontier models achieving five-percent field-level pass rates on complex nested documents, because repeated arrays must be row-aligned and an absent field is indistinguishable from an invented one. A naive single prompt with schema-constrained decoding guarantees syntactically valid JSON, not correct JSON: it silently fabricates plausible values for missing fields and emits no per-field trust signal, so callers ingest hallucinations. Evaluate a vision-language extractor combining page-level retrieval, per-field self-consistency across repeated re-reads and layout crops, logprob-and-agreement confidence fusion, mandatory source-span grounding with page and bounding-box coordinates, an explicit not_present sentinel, and arithmetic cross-checks on totals. Measure field-level precision, recall and F1, hallucination rate on deliberately absent fields, span-grounding accuracy and risk-coverage AUROC of the confidence, against a hand-labeled gold set of nested documents with injected omissions, beating a naive base-model prompt, constrained-decoding-only extraction, and a commercial OCR pipeline. Deliver as the prototype a minimal runnable Python MCP server (stdio) exposing the priced AI tool extract_schema_with_abstention that invokes a language or ML model to produce its output, with a typed input/output schema, an x402-style pay-per-call metering stub that records a per-call price in USDT and emits a settlement receipt, and one smoke test that exercises the tool end to end.Dogukan Ali Gundogan2026 · Zenodo (CERN European Organization for Nuclear Research) In Library
Agents ingesting contracts, invoices and filings need nested JSON matching a caller-supplied schema, but 2026 extraction benchmarks report frontier models achieving five-percent field-level pass rates on complex nested documents, because repeated arrays must be row-aligned and an absent field is indistinguishable from an invented one. A naive single prompt with schema-constrained decoding guarantees syntactically valid JSON, not correct JSON: it silently fabricates plausible values for missing fields and emits no per-field trust signal, so callers ingest hallucinations. Evaluate a vision-language extractor combining page-level retrieval, per-field self-consistency across repeated re-reads and layout crops, logprob-and-agreement confidence fusion, mandatory source-span grounding with page and bounding-box coordinates, an explicit not_present sentinel, and arithmetic cross-checks on totals. Measure field-level precision, recall and F1, hallucination rate on deliberately absent fields, span-grounding accuracy and risk-coverage AUROC of the confidence, against a hand-labeled gold set of nested documents with injected omissions, beating a naive base-model prompt, constrained-decoding-only extraction, and a commercial OCR pipeline. Deliver as the prototype a minimal runnable Python MCP server (stdio) exposing the priced AI tool extract_schema_with_abstention that invokes a language or ML model to produce its output, with a typed input/output schema, an x402-style pay-per-call metering stub that records a per-call price in USDT and emits a settlement receipt, and one smoke test that exercises the tool end to end.Dogukan Ali Gundogan2026 · Zenodo (CERN European Organization for Nuclear Research) In Library
© 2026 NYSGPT2525 LLC