Pith. sign in

REVIEW 4 major objections 6 minor 34 references

EzSQL: An SQL intermediate representation for improving SQL-to-text Generation

T0 review · 4 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

Pith's one-line read EzSQL, a deterministic SQL intermediate representation that removes JOINs and replaces set operators with AND/OR conjunctions before BART, achieves state-of-the-art BLEU on WikiSQL and Spider and generates synthetic questions that improve…

desk verdict A simple, deterministic SQL-to-text IR that improves BLEU and helps RAT-SQL augmentation; the set-operator rewrite needs a semantic equivalence check before the claims fully hold. read the letter →

arxiv 2411.18923 v2 pith:ONJBHRDD submitted 2024-11-28 cs.CL cs.AI

classification cs.CLcs.AI
keywords SQL-to-textgenerationEzSQLintermediaterepresentationBARTText-to-SQLdataaugmentationWikiSpider
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that the surface syntax of SQL—JOIN clauses, set operators, aliases, and keyword order—is what keeps pretrained language models from generating good natural-language descriptions. The authors propose EzSQL, a deterministic intermediate representation that rewrites a query into a simplified, more text-like form before it is fed to BART. On WikiSQL, EzSQL + BART reaches BLEU 40.62 versus 39.27 for BART on raw SQL, and on Spider it reaches 27.49 versus 19.34. The same model can generate synthetic question/SQL pairs that raise a RAT-SQL parser's exact-match accuracy on Spider from 71.8 to 73.3, which matters because text-to-SQL training data is expensive to annotate.

What carries the argument

EzSQL is the central object: a six-step simplification that flattens set operators into AND/OR conjunctions, eliminates JOIN and nested subqueries, replaces aliases with original descriptive names, rephrases FROM and AS, aligns DISTINCT and COUNT usage with natural language, and shortens long sequences. The load-bearing mechanism is Algorithm 2's merge-by-first-difference rule, which collapses the split branches of a UNION or INTERSECT into a single SELECT with one conjunction. This rule is what makes the rewritten input line up with how people phrase questions, and it is also the main semantic risk: the merge can change query meaning when the branches are not truly disjunctive. The function of EzSQL is distributional—it narrows the gap between the token sequences the encoder sees and the natural-language tokens the decoder must emit, so a pretrained model can generate without graph or tree embeddings.

What would settle it

Run Algorithm 2 on a UNION query whose two branches reference different tables, such as SELECT name FROM employees WHERE dept='sales' UNION SELECT name FROM contractors WHERE status='active'. The first-different-word merge rewrites this into a single SELECT over the first table with WHERE dept='sales' OR status='active', which drops the second table and the union semantics entirely. If human judges then mark BART's generated description of the original query as unfaithful on a set of such queries, or if the BLEU on that subset falls below the raw-SQL baseline, the semantic-preservation premise of EzSQL fails.

Watch

Extended reading notes

Core claim

The paper's central claim is that SQL's surface form, not the capacity of the generator, is the main obstacle to SQL-to-text: JOINs and set operators are rarely named in target questions, so they are noise for a pretrained encoder-decoder. EzSQL is a deterministic rewrite of the query that removes JOIN conditions, replaces UNION/INTERSECT/EXCEPT with OR/AND conjunctions, expands aliases into descriptive schema names, and rephrases keywords such as FROM and AS into language-like connectives. Because the rewrite is produced by hand-written rules, no new parameters are added, and the EzSQL string can be tokenized directly by BART. The paper reports BLEU 40.62 on WikiSQL and 27.49 on Spider for EzSQL + BART-large, against 39.27 and 19.34 for BART on raw SQL; when the same model generates questions for PCFG-sampled SQL queries, pre-training RAT-SQL on that data raises Spider exact-match accuracy from 71.8 to 73.3.

Load-bearing premise

The hand-crafted EzSQL rewrite rules preserve enough of a query's meaning—after deleting JOINs and replacing set operators with AND/OR—that a language model can still produce faithful descriptions of the original query.

Editorial extensions

If this is right

  • On WikiSQL, EzSQL + BART-large reaches BLEU 40.62 against 39.27 for BART on raw SQL; on Spider, 27.49 against 19.34.
  • No graph or tree embeddings are needed: a plain pretrained sequence-to-sequence model fed the EzSQL string outperforms specialized encoders.
  • Pre-training RAT-SQL on questions generated by EzSQL + BART lifts Spider exact-match accuracy from 71.8 to 73.3 under the same PCFG sampling and parser configuration.
  • Because the rewrite rules are hand-written and parameter-free, EzSQL can be dropped into any existing seq2seq SQL-to-text system.
  • By shortening long queries, EzSQL also reduces the input sequence length, which can lower the compute cost of the transformer encoder.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • An untested boundary: because EzSQL removes JOIN clauses entirely, its benefit should shrink on queries whose gold descriptions explicitly mention the join relationship; stratifying BLEU by whether the question names two tables would put this to the test.
  • A cleaner isolate of the IR effect would hold the PCFG-sampled SQL fixed and swap only the question generator (EzSQL + BART vs raw-SQL + BART), keeping parser and pre-training budget identical.
  • The paper's closing GPT-4 example points to a concrete extension: adding explicit natural-language markers for implicit SQL defaults, such as 'ascending' for ORDER BY or 'unique' for DISTINCT, could reduce the model's reliance on world knowledge.
  • Because short single-table queries are already close to natural language, EzSQL's gains may concentrate on long, join-heavy queries; a length-stratified evaluation would show where the representation actually earns its keep.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper proposes EzSQL, a deterministic intermediate representation that rewrites SQL queries (removing set operators, JOINs, aliases, and replacing keywords with more natural-language-like phrasing) before feeding them to a BART sequence-to-sequence model for SQL-to-text generation. Experiments on WikiSQL and Spider report BLEU scores of 40.62 and 27.49, respectively, improving over previous BART-based baselines. The paper further uses EzSQL-based text generation to synthesize pretraining data for RAT-SQL text-to-SQL parsing and reports an improvement from 71.8 to 73.3 exact match on Spider (Table 2).

Significance. If the claims hold, EzSQL would be a simple, model-agnostic IR that improves SQL-to-text generation without introducing additional model parameters, and it would provide a useful data augmentation tool for text-to-SQL. The IR itself is a hand-designed rule set with no fitted numeric parameters, which is a strength: the reported gains are not artifacts of test-set parameter tuning. The paper also makes a falsifiable prediction about the benefit of the IR for pretraining data. However, the central validity depends on whether EzSQL preserves SQL semantics while simplifying, and the current evaluation does not establish this: there is no execution check of rewritten queries, no faithfulness evaluation of generated text, and no statistical significance testing. The load-bearing set-operator rewrite (Algorithm 2) is demonstrably non-equivalent for common query shapes, so the reported BLEU gains may partly reflect task simplification rather than improved faithful generation.

major comments (4)
  1. [Section 3.2, Algorithm 2] Algorithm 2 does not preserve query semantics in general. Merging two SELECT subqueries by finding the first differing token and inserting OR/AND is only equivalent when the subqueries differ in a single WHERE predicate. For example, SELECT COUNT(*) FROM T WHERE A=1 UNION SELECT COUNT(*) FROM T WHERE B=2 yields two rows (one count per condition), whereas the EzSQL merge produces a single COUNT over rows satisfying A=1 OR B=2. The same issue arises with INTERSECT when projections or aggregates differ, and EXCEPT is not representable as a simple WHERE negation in such cases. Since Section 3.1 explicitly states that EzSQL maintains the 'semantic meaning,' the paper must either restrict Algorithm 2 to provably equivalent cases, provide an execution-based validation of the rewrite on the actual benchmarks, or revise the claim that EzSQL is meaning-preserving. Without this, the BLEU improvements on set-operation queries are confounded.
  2. [Section 4.1.1, Table 1] The evaluation reports single BLEU scores with no variance, confidence intervals, or significance tests. On WikiSQL, the gain over the BART baseline is 1.35 BLEU (39.27 vs. 40.62), which may be within run-to-run noise for a fine-tuned BART-large model. On Spider, the gain over the Shi et al. (2021) baseline is large in absolute terms, but that baseline is cited from prior work and not reproduced under identical conditions. The authors should run multiple seeds and report means and standard deviations, and they should reproduce the BART baseline in their own pipeline to ensure that the only difference is the input representation.
  3. [Section 4.1.2] The error analysis with Sentence-BERT is anecdotal and does not constitute a faithfulness evaluation. BLEU measures surface overlap, and the Sentence-BERT comparison in Figure 7 only reports similarity scores between gold, generated, and corrected sentences for a handful of examples; it does not measure whether the generated text preserves the meaning of the SQL. The central claim that EzSQL 'brings it as close as possible to natural language while maintaining the context and semantic meaning' requires a direct faithfulness check, such as human evaluation or an execution-based consistency test (e.g., parsing generated questions back to SQL and comparing execution results). Without this, the reported BLEU gains cannot be attributed to improved semantic understanding.
  4. [Section 4.2, Table 2] The text-to-SQL augmentation result is potentially confounded. The baseline RAT-SQL + Pre-Train (71.8) is taken from Wang et al. (2021), which uses a different data-generation pipeline. The 73.3 result with EzSQL-generated data is obtained with the same pretraining configuration but with newly generated questions; the improvement could come from the particular sampled SQL queries, the random seed, or other implementation details rather than from EzSQL specifically. The authors should reproduce the baseline pretraining with their own data-generation pipeline (e.g., using the original Wang et al. generator) and report variance across runs. The BERT-base comparison (69.6 vs. 65.4 and 68.2) is also based on a single run and lacks error bars.
minor comments (6)
  1. [Section 3.2, Algorithms 1–5] The pseudocode uses 'while' loops where conditional operations are intended, and the control flow is underspecified: Algorithm 2's 'while Nested query flag is equal to 1' would loop indefinitely if not for an implicit break. The authors should replace these with 'if' statements and clarify the termination conditions.
  2. [Section 3.2, Algorithm 4 and Section 3.3] Algorithm 4 replaces aliases with original names, but the subsequent Algorithm 5 deletes the 'as' keyword and the word after it. The description in the text (Section 3.2) says the original table name occurs before and after the 'as' keyword after Algorithm 4, which is confusing because Algorithm 4 replaces only alias occurrences, not the token immediately after 'as'. Please clarify the exact token-level transformations.
  3. [Table 2] The model name 'RY ANSQL' contains a spacing typo and should be 'RYANSQL'. Also, the table would benefit from a column indicating the base encoder (BERT-base vs. Electra-base) consistently, as the footnotes are easy to miss.
  4. [Section 2, Related Work] The section on intermediate representation mentions 'Natural SQL' (Gan et al., 2021) but does not discuss how EzSQL differs from it beyond 'dispenses nested subqueries and set operators.' A more detailed comparison, particularly of the simplification rules and coverage, would help position the contribution.
  5. [Section 4.3, Figures 8 and 9] The ablation figures report bar values but no error bars or statistical significance. The caption for Figure 9 labels the model 'RAT-SQL + Pre-Train with EzSQL' while the text and Table 2 use 'our model data'; please unify the terminology.
  6. [Section 5, Future Work] The GPT-4 example in the conclusion (ORDER BY count(*) with default ascending sort) is presented as motivation for future work, but it is not part of the formal evaluation. The authors should either integrate such correctness cases into the experiments or clearly separate this discussion from the results.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: EzSQL is a deterministic hand-designed IR evaluated against external benchmarks, with no fitted parameter renamed as a prediction and no load-bearing self-citation.

full rationale

The paper's central claims are that the EzSQL intermediate representation improves SQL-to-text BLEU scores on WikiSQL and Spider, and that data synthesized with an EzSQL-based generator improves a RAT-SQL parser on Spider. Neither claim reduces to its inputs by construction. EzSQL is a fixed, hand-written rewriting procedure (Algorithms 1-5) with no numeric parameters fitted to the benchmark; the BART model is trained and evaluated on standard train/test splits. The downstream parser experiment is also externally evaluated against gold SQL on the Spider test set, not against the synthesized questions, so the reported improvement is not forced by the generation setup. The paper contains no self-citations, and the cited prior IRs (Yu et al., Guo et al., Gan et al.) are external work, not the present authors' own results. The skeptical concern that Algorithm 2's set-operator rewrite may not preserve SQL semantics is a correctness or faithfulness risk, not a circularity: it does not make the output equivalent to the input by construction. Therefore, under the requirement to flag only specific reductions or self-citation chains, no circular step is present.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central contribution is a rule-based rewrite procedure with no fitted numeric parameters. Its validity depends on assumptions about semantic equivalence between SQL constructs and natural-language connectives, and on the pretrained BART model. No new physical or mathematical entities are introduced.

assumptions (4)
  • domain assumption BART's pretrained text-infilling capability can generate complete narrations from EzSQL's fragment-like simplified input.
    Central to Section 3.3, where the model relies on BART to fill in natural language around the simplified SQL fragments.
  • domain assumption Set operators in SQL (UNION, INTERSECT, EXCEPT) can be semantically replaced by OR/AND/WHERE conditions without losing meaning for natural language description.
    Assumed in Algorithms 1 and 2 and illustrated in Figures 2 and 3; if this mapping is incorrect for some queries, EzSQL would generate misleading text.
  • domain assumption The WikiSQL and Spider datasets provide correct gold text that is aligned with the simplified SQL semantics.
    Used in Section 4.1 for evaluation; any noise or misalignment in the gold pairs would affect the measured BLEU scores.
  • domain assumption The PCFG-sampled SQL queries from Wang et al. (2021) are representative enough that the synthesized text improves parser pretraining.
    Used in Section 4.2, following the prior method without validating coverage or quality of the sampled SQL distribution.

how reviews work

0 comments
Cite this review

Pith. "Pith review of EzSQL: An SQL intermediate representation for improving SQL-to-text Generation." pith.science (2026). https://pith.science/paper/ONJBHRDD

@misc{pith2026241118923,
  author       = {Pith},
  title        = {Pith review of: EzSQL: An SQL intermediate representation for improving SQL-to-text Generation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ONJBHRDD}},
  note         = {Machine review of arXiv:2411.18923}
}
read the original abstract

The SQL-to-text generation task traditionally uses template base, Seq2Seq, tree-to-sequence, and graph-to-sequence models. Recent models take advantage of pre-trained generative language models for this task in the Seq2Seq framework. However, treating SQL as a sequence of inputs to the pre-trained models is not optimal. In this work, we put forward a new SQL intermediate representation called EzSQL to align SQL with the natural language text sequence. EzSQL simplifies the SQL queries and brings them closer to natural language text by modifying operators and keywords, which can usually be described in natural language. EzSQL also removes the need for set operators. Our proposed SQL-to-text generation model uses EzSQL as the input to a pre-trained generative language model for generating the text descriptions. We demonstrate that our model is an effective state-of-the-art method to generate text narrations from SQL queries on the WikiSQL and Spider datasets. We also show that by generating pretraining data using our SQL-to-text generation model, we can enhance the performance of Text-to-SQL parsers.

Figures

Figures reproduced from arXiv: 2411.18923 by the authors.

Figure 1
Figure 1. The proposed SQL-to-text model a pre-trained language model for the generation of text descriptions. We propose an SQL-to-Text generator that leverages the capability of a pre-trained language model (BART) to generate text from a given SQL query. We first translate the SQL queries into EzSQL, which is more suitable for the pre-trained language model. The EzSQL is fed as input to BART, where it is directly tokenized … view at source ↗
Figure 2
Figure 2. EzSQL simplification exemplified [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Example demonstrating how EzSQL deals with set operators [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: EzSQL brings complex queries significantly closer to the gold text [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: Proposed Approach Example Handling set operators. EzSQL simply concatenates the conditions in a set operator where the conditions can be connected, as shown in [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]
Figure 6
Figure 6. Figure 6: Example demonstrating how EzSQL deals with aliases [PITH_FULL_IMAGE:figures/full_fig_p012_6.png]
Figure 7
Figure 7. Figure 7: Model error analysis with Sentence BERT. [PITH_FULL_IMAGE:figures/full_fig_p015_7.png]
Figure 8
Figure 8. Figure 8: Ablation study for SQL-to-Text translation task. [PITH_FULL_IMAGE:figures/full_fig_p017_8.png]
Figure 9
Figure 9. Figure 9: Ablation study for Text-to-SQL translation task. [PITH_FULL_IMAGE:figures/full_fig_p018_9.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 13 canonical work pages

  1. [1]

    , author Shin, M

    author Choi, D. , author Shin, M. C. , author Kim, E. , & author Shin, D. R. ( year 2020 ). title Ryansql: Recursively applying sketch-based slot fillings for complex text-to-sql in cross-domain databases . journal arXiv preprint arXiv:2004.03125 \/ ,

  2. [2]

    , author Chang, M.-W

    author Devlin, J. , author Chang, M.-W. , author Lee, K. , & author Toutanova, K. ( year 2019 ). title BERT : Pre-training of deep bidirectional transformers for language understanding . In booktitle Proceedings of the 2019 Conference of the North A merican Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Lo...

  3. [3]

    , author Mallinson, J

    author Dong, L. , author Mallinson, J. , author Reddy, S. , & author Lapata, M. ( year 2017 ). title Learning to paraphrase for question answering . In booktitle Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing \/ (pp. pages 875--886 ). address Copenhagen, Denmark : publisher Association for Computational Linguistics ...

  4. [4]

    , author Chen, X

    author Gan, Y. , author Chen, X. , author Xie, J. , author Purver, M. , author Woodward, J. R. , author Drake, J. , & author Zhang, Q. ( year 2021 ). title Natural sql: Making sql easier to infer from natural language specifications . In booktitle Findings of the Association for Computational Linguistics: EMNLP 2021 \/ (pp. pages 2030--2042 )

  5. [5]

    , author Zhan, Z

    author Guo, J. , author Zhan, Z. , author Gao, Y. , author Xiao, Y. , author Lou, J.-G. , author Liu, T. , & author Zhang, D. ( year 2019 a ). title Towards Complex Text-to- SQL in Cross-Domain Database with Intermediate Representation . In booktitle Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics \/ (pp. pages 4524...

  6. [6]

    , author Zhan, Z

    author Guo, J. , author Zhan, Z. , author Gao, Y. , author Xiao, Y. , author Lou, J.-G. , author Liu, T. , & author Zhang, D. ( year 2019 b ). title Towards complex text-to- SQL in cross-domain database with intermediate representation . In booktitle Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics \/ (pp. pages 4524...

  7. [7]

    , author Konstas, I

    author Iyer, S. , author Konstas, I. , author Cheung, A. , & author Zettlemoyer, L. ( year 2016 ). title Summarizing source code using a neural attention model . In booktitle Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) \/ (pp. pages 2073--2083 ). address Berlin, Germany : publisher Associ...

  8. [8]

    , & author Liang, P

    author Jia, R. , & author Liang, P. ( year 2016 ). title Data recombination for neural semantic parsing . In booktitle Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) \/ (pp. pages 12--22 ). address Berlin, Germany : publisher Association for Computational Linguistics . https://aclanthology.o...

Show all 34 references
  1. [9]

    author Kipf, T. N. , & author Welling, M. ( year 2016 ). title Semi-supervised classification with graph convolutional networks . journal arXiv preprint arXiv:1609.02907 \/ ,

  2. [10]

    , author Simitsis, A

    author Koutrika, G. , author Simitsis, A. , & author Ioannidis, Y. E. ( year 2010 ). title Explaining structured queries in natural language . In booktitle 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) \/ (pp. pages 333--344 ). organization IEEE

  3. [11]

    , author Liu, Y

    author Lewis, M. , author Liu, Y. , author Goyal, N. , author Ghazvininejad, M. , author Mohamed, A. , author Levy, O. , author Stoyanov, V. , & author Zettlemoyer, L. ( year 2020 ). title BART : Denoising sequence-to-sequence pre-training for natural language generation, tran...

  4. [12]

    author Lin, X. V. , author Socher, R. , & author Xiong, C. ( year 2020 ). title Bridging textual and tabular data for cross-domain text-to- SQL semantic parsing . In booktitle Findings of the Association for Computational Linguistics: EMNLP 2020 \/ (pp. pages 4870--4888 ). add...

  5. [13]

    , author Ott, M

    author Liu, Y. , author Ott, M. , author Goyal, N. , author Du, J. , author Joshi, M. , author Chen, D. , author Levy, O. , author Lewis, M. , author Zettlemoyer, L. , & author Stoyanov, V. ( year 2019 ). title Roberta: A robustly optimized bert pretraining approach . journal ...

  6. [14]

    , author B \"u hmann, L

    author Ngonga \ , A.-C. , author B \"u hmann, L. , author Unger, C. , author Lehmann, J. , & author Gerber, D. ( year 2013 ). title Sorry, i don't speak sparql: translating sparql queries into natural language . In booktitle Proceedings of the 22nd international conference on ...

  7. [15]

    , author Roukos, S

    author Papineni, K. , author Roukos, S. , author Ward, T. , & author Zhu, W.-J. ( year 2002 ). title Bleu: a method for automatic evaluation of machine translation . In booktitle Proceedings of the 40th annual meeting of the Association for Computational Linguistics \/ (pp. pa...

  8. [16]

    , author Haddow, B

    author Sennrich, R. , author Haddow, B. , & author Birch, A. ( year 2016 ). title Improving neural machine translation models with monolingual data . In booktitle Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) \/...

  9. [17]

    , author Ng, P

    author Shi, P. , author Ng, P. , author Wang, Z. , author Zhu, H. , author Li, A. H. , author Wang, J. , author dos Santos, C. N. , & author Xiang, B. ( year 2021 ). title Learning contextual representations for semantic parsing with generation-augmented pre-training . In book...

  10. [18]

    , author Zhang, Y

    author Song, L. , author Zhang, Y. , author Wang, Z. , & author Gildea, D. ( year 2018 ). title A graph-to-sequence model for AMR -to-text generation . In booktitle Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) ...

  11. [19]

    , author Shin, R

    author Wang, B. , author Shin, R. , author Liu, X. , author Polozov, O. , & author Richardson, M. ( year 2020 ). title RAT-SQL : Relation-aware schema encoding and linking for text-to- SQL parsers . In booktitle Proceedings of the 58th Annual Meeting of the Association for Com...

  12. [20]

    , author Yin, W

    author Wang, B. , author Yin, W. , author Lin, X. V. , & author Xiong, C. ( year 2021 ). title Learning to synthesize data for semantic parsing . In booktitle Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Hum...

  13. [21]

    , author Tatwawadi, K

    author Wang, C. , author Tatwawadi, K. , author Brockschmidt, M. , author Huang, P.-S. , author Mao, Y. , author Polozov, O. , & author Singh, R. ( year 2018 ). title Robust text-to-sql generation with execution-guided decoding . journal arXiv preprint arXiv:1807.03100 \/ ,

  14. [22]

    author Wang, D. C. , author Appel, A. W. , author Korn, J. L. , & author Serra, C. S. ( year 1997 ). title The zephyr abstract syntax description language. In booktitle DSL \/ (pp. pages 17--17 ). volume volume 97

  15. [23]

    , author Wu, L

    author Xu, K. , author Wu, L. , author Wang, Z. , author Feng, Y. , & author Sheinin, V. ( year 2018 ). title Sql-to-text generation with graph-to-sequence model . In booktitle Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing \/ (pp. pages...

  16. [24]

    , & author Neubig, G

    author Yin, P. , & author Neubig, G. ( year 2018 ). title TRANX : A transition-based neural abstract syntax parser for semantic parsing and code generation . In booktitle Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrati...

  17. [25]

    , author Wu, C.-S

    author Yu, T. , author Wu, C.-S. , author Lin, X. V. , author Tan, Y. C. , author Yang, X. , author Radev, D. , author Xiong, C. et al. ( year 2020 ). title Grappa: Grammar-augmented pre-training for table semantic parsing . In booktitle International Conference on Learning Re...

  18. [26]

    , author Yasunaga, M

    author Yu, T. , author Yasunaga, M. , author Yang, K. , author Zhang, R. , author Wang, D. , author Li, Z. , & author Radev, D. ( year 2018 a ). title S yntax SQLN et: Syntax tree networks for complex and cross-domain text-to- SQL task . In booktitle Proceedings of the 2018 Co...

  19. [27]

    , author Yasunaga, M

    author Yu, T. , author Yasunaga, M. , author Yang, K. , author Zhang, R. , author Wang, D. , author Li, Z. , & author Radev, D. ( year 2018 b ). title S yntax SQLN et: Syntax tree networks for complex and cross-domain text-to- SQL task . In booktitle Proceedings of the 2018 Co...

  20. [28]

    , author Zhang, R

    author Yu, T. , author Zhang, R. , author Yang, K. , author Yasunaga, M. , author Wang, D. , author Li, Z. , author Ma, J. , author Li, I. , author Yao, Q. , author Roman, S. , author Zhang, Z. , & author Radev, D. ( year 2018 c ). title S pider: A large-scale human-labeled da...

  21. [29]

    , author Wu, K

    author Zhang, A. , author Wu, K. , author Wang, L. , author Li, Z. , author Xiao, X. , author Wu, H. , author Zhang, M. , & author Wang, H. ( year 2021 ). title Data augmentation with hierarchical sql-to-question generation for cross-domain text-to-sql parsing . journal arXiv ...

  22. [30]

    , author Lewis, M

    author Zhong, V. , author Lewis, M. , author Wang, S. I. , & author Zettlemoyer, L. ( year 2020 ). title Grounded adaptation for zero-shot executable semantic parsing . In booktitle Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) ...

  23. [31]

    , author Xiong, C

    author Zhong, V. , author Xiong, C. , & author Socher, R. ( year 2017 ). title Seq2sql: Generating structured queries from natural language using reinforcement learning . journal arXiv preprint arXiv:1709.00103 \/ ,

  24. [32]

    URL: " 'urlintro :=

    ENTRY address author booktitle chapter edition editor howpublished institution journal key month note number organization pages publisher school series title type volume year eprint doi pubmed url lastchecked label extra.label sort.label short.list INTEGERS output.state before...

  25. [33]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  26. [34]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.