Challenge: Existing text-to-SQL models for complex queries are limited by the syntactic complexity of SQL.
Approach: They propose a question decomposition language that decomposes SQL queries into simple and regular sub-queries.
Outcome: The proposed language decomposes SQL queries into simple and regular sub-queries . it is more accessible to non-experts for complex queries, enabling interpretable output .

Similar Papers

Complex Question Decomposition for Semantic Parsing (P19-1)

Copied to clipboard

Challenge: Existing methods that ignore the decompositionality of complex questions are not suitable for complex question semantic parsing.
Approach: They propose a hierarchical semantic parsing method which utilizes the decompositionality of complex questions for semantic paring.
Outcome: The proposed method improves on a large scale complex question semantic parsing dataset.
Break It Down: A Question Understanding Benchmark (2020.tacl-1)

Copied to clipboard

Challenge: Understanding natural language questions entails the ability to break down a question into the requisite steps for computing its answer.
Approach: They introduce a Question Decomposition Meaning Representation (QDMR) for questions . they demonstrate that QDMRs can be annotated at scale using a hotpotQA dataset .
Outcome: The proposed model outperforms several natural baselines in the open-domain question answering hotpotQA dataset and can be deterministically converted to a pseudo-SQL formal language.
Weakly Supervised Text-to-SQL Parsing through Question Decomposition (2022.findings-naacl)

Copied to clipboard

Challenge: Text-to-SQL parsers are crucial in enabling non-experts to effortlessly query relational data.
Approach: They propose a weak supervision approach for training text-to-SQL parsers by using a question meaning representation called QDMR to synthesize SQL queries from annotated NL-SqL data.
Outcome: The proposed model performs competitively with those trained on annotated NL-SQL data.
Bridging the Gap between Synthetic and Natural Questions via Sentence Decomposition for Semantic Parsing (2023.tacl-1)

Copied to clipboard

Challenge: Existing methods to train a parser to perform zero-shot learning are limited by the lack of training data.
Approach: They propose a decomposition-based method to unify the sentence structures of questions . their method can generalize to natural questions with novel text expressions .
Outcome: The proposed method improves on synthetic data and on complex web questions with novel expressions.
SPARQLing Database Queries from Intermediate Question Decompositions (2021.emnlp-main)

Copied to clipboard

Challenge: Using annotated datasets is difficult as it requires query-language expertise.
Approach: They propose a crowdsourcing pipeline to annotate natural language questions using intermediate question representations.
Outcome: The proposed pipeline reduces the burden of annotating a large dataset with queries by using intermediate question representations.
DuoRAT: Towards Simpler Text-to-SQL Models (2021.naacl-main)

Copied to clipboard

Challenge: Recent text-to-SQL models can translate natural language questions to corresponding SQL queries on unseen databases.
Approach: They propose a re-implementation of the RAT-SQL model that uses only relation-aware or vanilla transformers as the building blocks.
Outcome: The proposed model is based on the spider dataset and shows it can be used on large databases without human intervention.
Semantic Parsing with Syntax- and Table-Aware SQL Generation (P18-1)

Copied to clipboard

Challenge: Existing approaches generate a SQL query word-by-word but results are incorrect or not executable due to mismatch between question words and table contents.
Approach: They propose a generative model to map natural language questions into SQL queries.
Outcome: The proposed model significantly improves state-of-the-art execution accuracy from 69.0% to 74.4% on a large question- SQL dataset.
Recent Advances in Text-to-SQL: A Survey of What We Have and What We Expect (2022.coling-1)

Copied to clipboard

Challenge: text-to-SQL is a language processing and database-based language processing (NLP) task is to convert natural utterances into SQL queries and its practical application is to build natural language interfaces to database systems.
Approach: They propose to conduct a systematic survey of text-to-SQL to examine the challenges and potential future directions.
Outcome: The proposed system converts natural utterances into SQL queries and is a representative task in semantic parsing.
Spider: A Large-Scale Human-Labeled Dataset for Complex and Cross-Domain Semantic Parsing and Text-to-SQL Task (D18-1)

Copied to clipboard

Challenge: Existing datasets for semantic parsing are too small in terms of number of programs for training modern data-intensive models.
Approach: They propose a large-scale complex and cross-domain semantic parsing task for a database . they use a dataset with 10,181 questions and 5,693 unique complex SQL queries .
Outcome: The proposed task is different from previous tasks because it uses the same database and program . the best model achieves only 9.7% exact matching accuracy on a database split setting.
A Pilot Study for Chinese SQL Semantic Parsing (D19-1)

Copied to clipboard

Challenge: Existing datasets to map natural language text into SQL are limited in their use in question-to-sql mapping.
Approach: They propose to use a Chinese-based semantic parser to map natural language text into SQL.
Outcome: The proposed dataset compares a character-based parser with a word embedding scheme for Chinese . the results show that the parsers are subject to segmentation errors and cross-lingual embedders are useful for text-to-SQL mapping.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations