paper-with-me

홈 › Papers

IncSQL: Training Incremental Text-to-SQL Parsers with Non-Deterministic Oracles

2018-09-13 · Tianze Shi, Kedar Tatwawadi, Kaushik Chakrabarti, Yi Mao, Oleksandr Polozov, Weizhu Chen

We present a sequence-to-action parsing approach for the natural language to SQL task that incrementally fills the slots of a SQL query with feasible actions from a pre-defined inventory. To account for the fact that typically there are multiple correct SQL queries with the same or very similar semantics, we draw inspiration from syntactic parsing techniques and propose to train our sequence-to-action models with non-deterministic oracles. We evaluate our models on the WikiSQL dataset and achieve an execution accuracy of 83.7% on the test set, a 2.1% absolute improvement over the models trained with traditional static oracles assuming a single correct target SQL query. When further combined with the execution-guided decoding strategy, our model sets a new state-of-the-art performance at an execution accuracy of 87.1%.

📄 PDF Abstract BibTeX arXiv:1809.05054

Code (0)

등록된 구현이 없습니다.

Tasks

Action ParsingText to SQLText-To-SQL

Similar Papers 제목 키워드 기반

From Partial to Strictly Incremental Constituent Parsing

2024-02-05 · Ana Ezquerro, Carlos Gómez-Rodríguez, David Vilares

We study incremental constituent parsers to assess their capacity to output trees based on prefix representations alone. Guided by strictly left-to-right generative language models and tree-decoding modules, we build par…

Decoder

Memory-bounded Neural Incremental Parsing for Psycholinguistic Prediction

2020-07-01 · WS 2020 7 · Lifeng Jin, William Schuler

Syntactic surprisal has been shown to have an effect on human sentence processing, and can be predicted from prefix probabilities of generative incremental parsers. Recent state-of-the-art incremental generative neural p…

PredictionSentence

Strongly Incremental Constituency Parsing with Graph Neural Networks

2020-10-27 · NeurIPS 2020 12 · Kaiyu Yang, Jia Deng

Parsing sentences into syntax trees can benefit downstream applications in NLP. Transition-based parsers build trees by executing actions in a state transition system. They are computationally efficient, and can leverage…

Constituency ParsingGraph Neural NetworkSentence

Training Deterministic Parsers with Non-Deterministic Oracles

2013-01-01 · TACL 2013 1 · Yoav Goldberg, Joakim Nivre

Greedy transition-based parsers are very fast but tend to suffer from error propagation. This problem is aggravated by the fact that they are normally trained using oracles that are deterministic and incomplete in the se…

ARCvalid

On the Challenges of Fully Incremental Neural Dependency Parsing

2023-09-28 · Ana Ezquerro, Carlos Gómez-Rodríguez, David Vilares

Since the popularization of BiLSTMs and Transformer-based bidirectional encoders, state-of-the-art syntactic parsers have lacked incrementality, requiring access to the whole sentence and deviating from human language pr…

Dependency ParsingSentence