Neural Transition Based Parsing of Web Queries: An Entity Based Approach (D18-1)
Copied to clipboard
| Challenge: | Existing query parsers that account for the unique grammar of web queries rely on resources not available outside of big web corporations. |
| Approach: | They propose a biLSTM query parser that explicitly accounts for the unique grammar of queries. |
| Outcome: | The proposed query parser outperforms existing state-of-the-art parsers on 2500 annotated queries. |
Similar Papers
Improving Text-to-SQL Semantic Parsing with Fine-grained Query Understanding (2022.emnlp-industry)
Copied to clipboard
Jun Wang, Patrick Ng, Alexander Hanbo Li, Jiarong Jiang, Zhiguo Wang, Bing Xiang, Ramesh Nallapati, Sudipta Sengupta
| Challenge: | Recent research on Text-to-SQL semantic parsing relies on parser or heuristic based approach to understand natural language query. |
| Approach: | They propose a general-purpose, modular neural semantic parsing framework that is based on token-level fine-grained query understanding. |
| Outcome: | The proposed framework outperforms the state-of-the-art model by 2.7% on a WikiTableQuestions test set. |
End-to-End Graph-Based TAG Parsing with Neural Networks (N18-1)
Copied to clipboard
| Challenge: | Using BiLSTMs, highway connections, and character-level CNNs, we propose a graph-based Tree Adjoining Grammar (TAG) parser. |
| Approach: | They propose a graph-based Tree Adjoining Grammar parser that uses BiLSTMs, highway connections, and character-level CNNs. |
| Outcome: | The proposed parser outperforms the previously reported best by more than 2.2 LAS and UAS points. |
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. |
Transition-based Parsing with Stack-Transformers (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing parsing systems use local or global models of the parser state to improve performance. |
| Approach: | They propose to modify the sequence-to-sequence Transformer to model global or local parser states in transition-based parsing. |
| Outcome: | The proposed model significantly improves performance on dependency and Abstract Meaning Representation (AMR) parsing tasks. |
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. |
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. |
Deep Contextualized Word Embeddings in Transition-Based and Graph-Based Dependency Parsing - A Tale of Two Parsers Revisited (D19-1)
Copied to clipboard
| Challenge: | In recent years, dependency parsing has shifted from discrete features to neural networks and continuous representations. |
| Approach: | They propose to use deep contextualized word embeddings to pack information about global sentence structure into local feature representations to make the two approaches virtually equivalent in terms of accuracy and error profile. |
| Outcome: | The proposed model improves the accuracy and error profile of transition-based and graph-based dependency parsers on 13 languages. |
Grammar-Constrained Neural Semantic Parsing with LR Parsers (2021.findings-acl)
Copied to clipboard
| Challenge: | a context-free grammar can be used to enforce syntactical constraints when predicting logical forms. |
| Approach: | They propose a model that uses an LR parser to maintain syntactically valid sequences throughout the decoding procedure. |
| Outcome: | The proposed model is conceptually simpler and adds less overhead during inference compared to other approaches . it is compared with existing grammar-guided decoding frameworks and is cost-effective . |
Transition-based Semantic Dependency Parsing with Pointer Networks (2020.acl-main)
Copied to clipboard
| Challenge: | Existing dependency parsers cannot be directly applied, so they need to be adaptable to deal with the absence of singlehead and connectedness constraints. |
| Approach: | They propose a transition system that produces labelled directed acyclic graphs and performs semantic dependency parsing with Pointer Networks. |
| Outcome: | The proposed system outperforms graph-based models and outperformed existing models on a harder NLP problem. |
Better Transition-Based AMR Parsing with a Refined Search Space (D18-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) parsers require a pipeline approach to learn concepts and relationships. |
| Approach: | They propose to use a transition-based search space to conduct a new compact AMR graph and an improved oracle to perform the search. |
| Outcome: | The proposed system achieves the state-of-the-art performance on various datasets with minimal additional information. |