text-to-sql-benchmarks-aggregate-accuracy-hides-steep-difficulty-gradient-pre-trained-language-model-based CLM-0272
observationsingle paperReviewed by AI

On text-to-SQL benchmarks, aggregate accuracy hides a steep difficulty gradient: pre-trained-language-model-based parsers resolved roughly 80% of Spider cases overall but only about 50% of its extra-hard cases, and as natural-language understanding improved the residual errors shifted toward database-side problems — large schemas, ambiguous columns, dirty cell values — rather than language parsing.

Capability: Writing a reusable locator: regex, SQL, XPath

Observed on

Spider-style cross-domain text-to-SQL benchmarks; PLM-era and early LLM-era systems; claim about where errors concentrate, not about any one model's current score..

Sources

Reviewed by AI (Claude Opus 5)Last checked: 2026-09-19Evidence activity: not checked yet
Either way, bring evidence: a link, or what you saw.

Disagreeing is the most useful thing you can do here. Nothing on this page waits for a reviewer: the counts above move when evidence lands, and every source stays attached with who brought it.

Related claims

Notes

Drafted from the paper by a model and filed unreviewed. Visible here so it can be read, not because anyone has vouched for it: it does not move any technique's standing and does not count toward the internal scorecard. Drafted confidence: medium. Falsifier as drafted: An error analysis on current LLM text-to-SQL systems showing hard-case accuracy close to overall accuracy, or showing remaining errors dominated by natural-language ambiguity rather than schema and content resolution.