A Tale of Two Linkings: Dynamically Gating between Schema Linking and Structural Linking for Text-to-SQL Parsing

• URL: http://arxiv.org/abs/2009.14809v2
• Date: Sun, 22 Nov 2020 20:48:52 GMT
• Title: A Tale of Two Linkings: Dynamically Gating between Schema Linking and Structural Linking for Text-to-SQL Parsing
• Authors: Sanxing Chen, Aidan San, Xiaodong Liu, Yangfeng Ji
• Abstract summary: In Text-to- semantic parsing, selecting the correct entities for the generatedsql query is both crucial and challenging. We two linking processes to address this challenge: schema linking which links explicit NL mentions to the database and structural linking which links the entities in the outputsql with their structural relationships in the database schema. Integrating the proposed method with two graph neural network-based semantics together with BERT representations demonstrates substantial gains in parsing accuracy on the challenging Spider dataset.
• Score: 25.81069211061945
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In Text-to-SQL semantic parsing, selecting the correct entities (tables and columns) for the generated SQL query is both crucial and challenging; the parser is required to connect the natural language (NL) question and the SQL query to the structured knowledge in the database. We formulate two linking processes to address this challenge: schema linking which links explicit NL mentions to the database and structural linking which links the entities in the output SQL with their structural relationships in the database schema. Intuitively, the effectiveness of these two linking processes changes based on the entity being generated, thus we propose to dynamically choose between them using a gating mechanism. Integrating the proposed method with two graph neural network-based semantic parsers together with BERT representations demonstrates substantial gains in parsing accuracy on the challenging Spider dataset. Analyses show that our proposed method helps to enhance the structure of the model output when generating complicated SQL queries and offers more explainable predictions.

Related papers

• Schema-Aware Multi-Task Learning for Complex Text-to-SQL [4.913409359995421]
  We present a schema-aware multi-task learning framework (named MT) for complicatedsql queries. Specifically, we design a schema linking discriminator module to distinguish the valid question-schema linkings. On the decoder side, we define 6-type relationships to describe the connections between tables and columns.
  arXiv  Detail & Related papers  (2024-03-09T01:13:37Z)
• SQL-PaLM: Improved Large Language Model Adaptation for Text-to-SQL (extended) [53.95151604061761]
  This paper introduces the framework for enhancing Text-to- filtering using large language models (LLMs) With few-shot prompting, we explore the effectiveness of consistency decoding with execution-based error analyses. With instruction fine-tuning, we delve deep in understanding the critical paradigms that influence the performance of tuned LLMs.
  arXiv  Detail & Related papers  (2023-05-26T21:39:05Z)
• QURG: Question Rewriting Guided Context-Dependent Text-to-SQL Semantic Parsing [46.05006486399823]
  This paper presents QURG, a novel Question Rewriting Guided approach to help the models achieve adequate contextual understanding. We first train a question rewriting model to complete the current question based on question context, and convert them into a rewriting edit matrix. We further design a two-stream matrix encoder to jointly model rewriting relations between question and context, and the schema linking relations between natural language and structured schema.
  arXiv  Detail & Related papers  (2023-05-11T08:45:55Z)
• Improving Text-to-SQL Semantic Parsing with Fine-grained Query Understanding [84.04706075621013]
  We present a general-purpose, modular neural semantic parsing framework based on token-level fine-grained query understanding. Our framework consists of three modules: named entity recognizer (NER), neural entity linker (NEL) and neural entity linker (NSP)
  arXiv  Detail & Related papers  (2022-09-28T21:00:30Z)
• Proton: Probing Schema Linking Information from Pre-trained Language Models for Text-to-SQL Parsing [66.55478402233399]
  We propose a framework to elicit relational structures via a probing procedure based on Poincar'e distance metric. Compared with commonly-used rule-based methods for schema linking, we found that probing relations can robustly capture semantic correspondences. Our framework sets new state-of-the-art performance on three benchmarks.
  arXiv  Detail & Related papers  (2022-06-28T14:05:25Z)
• S$^2$SQL: Injecting Syntax to Question-Schema Interaction Graph Encoder for Text-to-SQL Parsers [66.78665327694625]
  We propose S$2$, injecting Syntax to question- encoder graph for Text-to- relational parsing. We also employ the decoupling constraint to induce diverse edge embedding, which further improves the network's performance. Experiments on the Spider and robustness setting Spider-Syn demonstrate that the proposed approach outperforms all existing methods when pre-training models are used.
  arXiv  Detail & Related papers  (2022-03-14T09:49:15Z)
• SADGA: Structure-Aware Dual Graph Aggregation Network for Text-to-SQL [29.328698264910596]
  One of the most challenging problems of Text-to-Graph is how to generalize the trained model to the unseen database schemas. We propose a Structure-Aware Dual Graph Aggregation Network (SADGA) for cross-domain Text-to-Graph. We achieve 3rd place on the challenging Text-to-Graph benchmark Spider at the time of writing.
  arXiv  Detail & Related papers  (2021-11-01T01:50:28Z)
• Bridging Textual and Tabular Data for Cross-Domain Text-to-SQL Semantic Parsing [110.97778888305506]
  BRIDGE represents the question and DB schema in a tagged sequence where a subset of the fields are augmented with cell values mentioned in the question. BRIDGE attained state-of-the-art performance on popular cross-DB text-to- relational benchmarks. Our analysis shows that BRIDGE effectively captures the desired cross-modal dependencies and has the potential to generalize to more text-DB related tasks.
  arXiv  Detail & Related papers  (2020-12-23T12:33:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.