Pith. sign in

REVIEW 10 cited by

PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.05093 v1 pith:4NVG7ENX submitted 2021-09-10 cs.CL cs.PL

PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Models

classification cs.CL cs.PL
keywords modelspicarddecodinglanguageauto-regressivecodeconstrainedfine-tuned
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Large pre-trained language models for textual data have an unconstrained output space; at each decoding step, they can produce any of 10,000s of sub-word tokens. When fine-tuned to target constrained formal languages like SQL, these models often generate invalid code, rendering it unusable. We propose PICARD (code and trained models available at https://github.com/ElementAI/picard), a method for constraining auto-regressive decoders of language models through incremental parsing. PICARD helps to find valid output sequences by rejecting inadmissible tokens at each decoding step. On the challenging Spider and CoSQL text-to-SQL translation tasks, we show that PICARD transforms fine-tuned T5 models with passable performance into state-of-the-art solutions.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 10 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. EcoTable: Cost-effective Table Integration in Data Lakes for Natural Language Queries

    cs.DB 2026-06 unverdicted novelty 6.0

    EcoTable is the first NL-based data integration framework that builds a join-likelihood graph, uses two-stage schema linking and Steiner tree search to find paths, then generates transformations with LLMs, reporting >...

  2. EcoTable: Cost-effective Table Integration in Data Lakes for Natural Language Queries

    cs.DB 2026-06 conditional novelty 6.0

    Query-driven table integration that uses Steiner-tree search to choose which joins LLMs must verify, reporting 30%+ accuracy gains at 5x lower LLM cost.

  3. To Know is to Construct: Schema-Constrained Generation for Agent Memory

    cs.CL 2026-04 unverdicted novelty 6.0

    SCG-MEM reformulates agent memory access as schema-constrained generation within dynamic cognitive schemas, using assimilation and accommodation for updates plus an associative graph for reasoning, and outperforms ret...

  4. Natural Language Interfaces for Spatial and Temporal Databases: A Comprehensive Overview of Methods, Taxonomy, and Future Directions

    cs.DB 2026-03 unverdicted novelty 6.0

    A literature survey that taxonomizes methods, datasets, and evaluation practices for natural language interfaces to geospatial and temporal databases while identifying recurring trends and future directions.

  5. XGrammar-2: Efficient Dynamic Structured Generation Engine for Agentic LLMs

    cs.AI 2026-01 conditional novelty 6.0

    XGrammar-2 makes dynamic, tag-triggered structured generation fast by dispatching to cached substructure grammars with an Earley-based adaptive token-mask cache.

  6. TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation

    cs.LG 2025-11 unverdicted novelty 6.0

    TreeCoder improves LLM code generation accuracy by representing decoding as an optimizable tree search over programs with first-class constraints for syntax, style, and execution, outperforming baselines on MBPP and S...

  7. Theory-Level Autoformalization: From Isolated Statements to Unified Formal Knowledge Bases

    cs.AI 2026-07 conditional novelty 5.0

    Autoformalization should target complete theories—axioms, definitions, lemmas, proofs—as unified formal libraries, not isolated statements.

  8. CogRAG: Tackling Heterogeneous Cognitive Demands in RAG via Stratified Retrieval and Reasoning

    cs.CL 2026-04 unverdicted novelty 5.0

    Stratifying RAG retrieval and reasoning by predicted cognitive load (Bloom-inspired) raises Qwen3-8B accuracy on a dietitian exam from 73.4% to 85.8% (single-choice) and 63.3% to 80.5% (scenario).

  9. TAHOE: Text-to-SQL with Automated Hint Optimization from Experience

    cs.DB 2026-06 unverdicted novelty 4.0

    TAHOE builds a Hint Bank from error traces to raise Text-to-SQL pass rates on Spider 2.0-Snow from 61.95% to 79.42% for GPT-5.5 without parameter updates.

  10. CogRAG: Tackling Heterogeneous Cognitive Demands in RAG via Stratified Retrieval and Reasoning

    cs.CL 2026-04 unverdicted novelty 4.0

    CogRAG+ raises LLM accuracy on a dietitian exam to 85.8% by using dual-path retrieval and structured reasoning templates.