GraphQ IR: Unifying the Semantic Parsing of Graph Query Languages with One Intermediate Representation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to neural semantic parsing are limited by the semantic gap between natural and formal languages. |
| Approach: | They propose a unified intermediate representation for graph query languages, named GraphQ IR, which has a natural-language-like expression that bridges the semantic gap and formally defined syntax that maintains the graph structure. |
| Outcome: | The proposed representation can convert user queries into graphQ IR, which can later be losslessly compiled into various downstream graph query languages. |
Similar Papers
Compositional Semantic Parsing across Graphbanks (P19-1)
Copied to clipboard
| Challenge: | Existing semantic parsers that map sentences to graph-based meaning representations are hand-designed for specific graphbanks. |
| Approach: | They propose a compositional neural semantic parser which achieves competitive accuracies across graphbanks. |
| Outcome: | The proposed system achieves competitive accuracies across a variety of graphbanks. |
Parsing into Variable-in-situ Logico-Semantic Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | a new type of graph-based meaning representation allows analysis for scope-related phenomena. |
| Approach: | They propose variable-in-situ logico-semantic graphs to bridge gap between semantic graph and logical form parsing. |
| Outcome: | The proposed graph-based meaning representation achieves 92.39% accuracy in terms of elementary dependency match . the output of the proposed parser is highly coherent . |
Towards Complex Text-to-SQL in Cross-Domain Database with Intermediate Representation (P19-1)
Copied to clipboard
| Challenge: | IRNet synthesizes SQL queries in an end-to-end manner, but it yields unsatisfactory performance on public benchmarks. |
| Approach: | They propose a neural approach called IRNet for complex and cross-domain Text-to-SQL. |
| Outcome: | IRNet achieves 46.7% accuracy on the Spider benchmark, a 19.5% improvement over state-of-the-art approaches. |
Interactive Semantic Parsing with Reinforcement Learning for Knowledge Graph Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to improve LLM reliability rely on factual hallucinations . Existing methods rely only on graph traversal, resulting in imprecise retrieval and heavy post-processing burdens. |
| Approach: | They propose a framework that integrates knowledge Graphs as structured, high-fidelity buffers to enhance LLM reliability. |
| Outcome: | The proposed framework allows logical constraints to be dynamically interleaved with graph search while optimizing via reinforcement learning with only final answer feedback eliminates the need for gold program annotations. |
Exploiting Abstract Meaning Representation for Open-Domain Question Answering (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing work attempts to address these challenges using Pretrained Language Models (PLMs) but the diversity of surface form expressions can hinder the model’s ability to capture accurate correlations, especially when the context is lengthy and complex. |
| Approach: | They propose a method known as Graph-as-Token (GST) to incorporate AMRs into PLMs to assist the model in understanding complex semantic information. |
| Outcome: | The proposed method outperforms existing methods and significantly improves performance on both Natural Questions and TriviaQA. |
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. |
An efficient method for Natural Language Querying on Structured Data (2023.acl-industry)
Copied to clipboard
| Challenge: | a new approach to NLQ on structured data is based on text-to-SQL type semantic parsing . domain classification, domain classification and domain classification are the main tasks . semantic parsed queries are less common when information is in structured form . |
| Approach: | They propose an efficient and reliable approach to natural language Querying on databases . they use domain classification, domain classification and slot/entity extraction to query a DB . |
| Outcome: | The proposed approach simplifies the NLQ on structured data problem to the following "bread and butter" tasks. |
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. |
Laziness Is a Virtue When It Comes to Compositionality in Neural Semantic Parsing (2023.acl-long)
Copied to clipboard
Maxwell Crouse, Pavan Kapanipathi, Subhajit Chaudhury, Tahira Naseem, Ramon Fernandez Astudillo, Achille Fokoue, Tim Klinger
| Challenge: | Compositional generalization is a key feature of human intelligence and has been identified as a major point of weakness in neural methods for semantic parsing. |
| Approach: | They propose a neural parsing generation method that constructs logical forms from the bottom up, beginning from the logical form’s leaves. |
| Outcome: | The proposed method outperforms general-purpose parsers on a CFQ dataset and two other Text-to-SQL datasets while also being competitive with parser that have been tailored to each task. |
Uni-Parser: Unified Semantic Parser for Question Answering on Knowledge Base and Database (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches on semantic parsing suffer from exponential growth of logical form candidates and can hardly generalize to unseen data. |
| Approach: | They propose a unified semantic parser for question answering on KB and DB . they define the primitive as the essential element in their framework . |
| Outcome: | The proposed framework can predict logical forms by altering and composing top-ranked primitives with different operations. |