Representing Schema Structure with Graph Neural Networks for Text-to-SQL Parsing (P19-1)
Copied to clipboard
| Challenge: | Semantic parsing to SQL has largely ignored the structure of the database schema . a recent study used a simple DB that was observed at both training and test time. |
| Approach: | They propose a semantic parser where the schema structure is encoded with a graph neural network and used at both encoding and decoding time. |
| Outcome: | The proposed parser improves from 33.8% to 39.4%, dramatically above the current state of the art, which is at 19.7%. |
Similar Papers
Global Reasoning over Database Structures for Text-to-SQL Parsing (D19-1)
Copied to clipboard
| Challenge: | Existing semantic parsers only select a set of database constants at training time . current models only consider local information, not global ones . |
| Approach: | They propose a semantic parser that globally reasons about the structure of the query to make a more contextually-informed selection of database constants. |
| Outcome: | The proposed model increases accuracy from 39.4% to 47.4% on a zero-shot semantic parsing dataset with complex databases. |
Graph-to-Tree Neural Networks for Learning Structured Input-Output Translation with Applications to Semantic Parsing and Math Word Problem (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Graph2Tree model encodes graph-structured input and decodes tree-structures output. |
| Approach: | They propose a novel Graph-to-Tree Neural Network consisting of a graph encoder and a hierarchical tree decoder that encodes an augmented graph-structured input and decodes a tree-structure-output. |
| Outcome: | The proposed model outperforms or matches the performance of other state-of-the-art models on two problems, neural semantic parsing and math word problem. |
Graph-Based Decoding for Task Oriented Semantic Parsing (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing paradigms for semantic parsing are sequence-to-sequence and AMR parsers. |
| Approach: | They propose to formulate parsing as a sequence-to-sequence task using graph-based decoding techniques developed for syntactic parsers. |
| Outcome: | The proposed approach is competitive with sequence decoders on the standard setting and offers significant improvements in data efficiency and data availability. |
ShadowGNN: Graph Projection Neural Network for Text-to-SQL Parser (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing semantic parsing models struggle to adapt to unseen database schemas . a new architecture, ShadowGNN, processes schemas at abstract and semantic levels . |
| Approach: | They propose a new architecture which processes schemas at abstract and semantic levels. |
| Outcome: | The proposed architecture outperforms state-of-the-art models on a text-to-sql benchmark . it uses domain-independent representations to extract logical linking between question and schema . |
Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model (D18-1)
Copied to clipboard
| Challenge: | Existing neural semantic parsers extract word order features while neglecting other valuable syntactic information. |
| Approach: | They propose to use syntactic graph to represent three types of syntaktic information . they then employ a graph-to-sequence model to encode the syntastic graph and decode a logical form . |
| Outcome: | The proposed model is comparable to the state-of-the-art on Jobs640, ATIS, and Geo880. |
Leveraging AMR Graph Structure for Better Sequence-to-Sequence AMR Parsing (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent studies on AMR parsing often regard this task as a seq2seq translation problem. |
| Approach: | They propose to translate AMR graphs into AMR token sequences in pre-processing and recover AMR from sequences after decoding. |
| Outcome: | The proposed approach outperforms baseline and achieves 85.5 0.1 and 84.2 0.2 Smatch scores on AMR 2.0 and AMR 3.0. |
Graph Enhanced Cross-Domain Text-to-SQL Generation (D19-53)
Copied to clipboard
| Challenge: | Existing deep learning approaches for semantic parsing do not generalize to unseen data sets . existing benchmarks have shown text-to-SQL parsers do not generally perform well to unsen SQL queries. |
| Approach: | They propose a new cross-domain learning scheme to perform text-to-SQL translation . they demonstrate its use on a large-scale cross- domain text- to-Sql data set Spider . |
| Outcome: | The proposed learning scheme improves on a large-scale text-to-SQL data set. |
A Tale of Two Linkings: Dynamically Gating between Schema Linking and Structural Linking for Text-to-SQL Parsing (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for text-to-SQL semantic parsing require strict structured prediction due to its application scenario where the output SQL will be sent to an executor program directly. |
| Approach: | They propose to use schema linking and structural linking to link NL to the database schema. |
| Outcome: | The proposed method shows significant gains on the Spider dataset. |
SQL-to-Text Generation with Graph-to-Sequence Model (D18-1)
Copied to clipboard
| Challenge: | Existing approaches to generate SQL-to-text using seq2seq models do not capture graph-structured information in SQL query. |
| Approach: | They propose a graph-to-sequence model to encode global structure information into node embeddings. |
| Outcome: | The proposed model outperforms the Seq2Seq and Tree2Sq baselines on the WikiSQL and Stackoverflow datasets. |
Graph-based Dependency Parsing with Graph Neural Networks (P19-1)
Copied to clipboard
| Challenge: | In graph-based dependency parsers, learning representations is gaining in importance, and we use graph neural networks to learn the representations. |
| Approach: | They propose to use graph neural networks to learn dependency tree nodes and propose to add a new aggregation function to the system. |
| Outcome: | The proposed model achieves the best UAS and LAS on PTB (96.0%, 94.3%) without using external resources. |