English

Reliable Answers for Recurring Questions: Boosting Text-to-SQL Accuracy with Template Constrained Decoding

Computation and Language 2026-05-01 v1 Artificial Intelligence Databases Information Retrieval

Abstract

Large language models (LLMs) have revolutionized Text-to-SQL generation, allowing users to query structured data using natural language with growing ease. Yet, real-world deployment remains challenging, especially in complex or unseen schemas, due to inconsistent accuracy and the risk of generating invalid SQL. We introduce Template Constrained Decoding (TeCoD), a system that addresses these limitations by harnessing the recurrence of query patterns in labeled workloads. TeCoD converts historical NL-SQL pairs into reusable templates and introduces a robust template selection module that uses a fine-tuned natural language inference model to match or reject queries efficiently. Once the template is selected, TeCoD enforces it during SQL generation through grammar-constrained decoding, implemented via a novel partitioned strategy that ensures both syntactic validity and efficiency. Together, these components yield up to 36% higher execution accuracy than in-context learning (ICL) and 2.2x lower latency on matched queries.

Keywords

Cite

@article{arxiv.2604.28028,
  title  = {Reliable Answers for Recurring Questions: Boosting Text-to-SQL Accuracy with Template Constrained Decoding},
  author = {Smit Jivani and Sarvam Maheshwari and Sunita Sarawagi},
  journal= {arXiv preprint arXiv:2604.28028},
  year   = {2026}
}

Comments

Project Code: https://github.com/SSLab-CSE-IITB/tecod

R2 v1 2026-07-01T12:43:52.264Z