| Challenge: | Semantic parsing is the task of mapping natural language to machine interpretable meaning representations. |
| Approach: | They propose a graph-aware sequence model that generates only well-formed graphs . their model is based on a multilingual semantic graphbank . |
| Outcome: | The proposed model yields competitive results in English and establishes the first results for German, Italian and Dutch. |
Similar Papers
Accurate polyglot semantic parsing with DAG grammars (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Semantic parsers treat graphs as strings or trees, but there is no guarantee that the output is a well-formed graph. |
| Approach: | They propose a graph-aware sequence model that utilizes a DAG grammar to guide graph generation. |
| Outcome: | The proposed model outperforms string-based and DAG-grammar models by a large margin and can guarantee the well-formed graphs. |
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. |
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. |
Sequence-to-Action: End-to-End Semantic Graph Generation for Semantic Parsing (P18-1)
Copied to clipboard
| Challenge: | Existing methods for semantic parsing are difficult to design and learn, especially in wideopen domains. |
| Approach: | They propose a neural semantic parsing approach which models semantic par- sing as an end-to-end semantic graph generation process. |
| Outcome: | The proposed model achieves state-of-the-art performance on Overnight dataset and gets competitive performance on Geo and Atis datasets. |
Discourse Representation Structure Parsing (P18-1)
Copied to clipboard
| Challenge: | Existing semantic parsers are data-driven using annotated examples consisting of utterances and their meaning representations. |
| Approach: | They propose a method which transforms Discourse Representation Structures (DRSs) to trees and develop a structure-aware model which decomposes the decoding process into three stages. |
| Outcome: | The proposed model outperforms baseline models on the Groningen Meaning Bank (GMB) by a wide margin. |
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. |
Unsupervised Recurrent Neural Network Grammars (N19-1)
Copied to clipboard
| Challenge: | RNNGs model syntax and structure by incrementally generating a syntax tree and sentence in a top-down, left-to-right order. |
| Approach: | They explore unsupervised learning of recurrent neural network grammars for language modeling and grammar induction. |
| Outcome: | The proposed model outperforms standard sequential language models and improves parsing performance. |
Coarse-to-Fine Decoding for Neural Semantic Parsing (P18-1)
Copied to clipboard
| Challenge: | Experimental results show that semantic parsing is more efficient than using simple decoders. |
| Approach: | They propose a structure-aware neural architecture which decomposes the semantic parsing process into two stages. |
| Outcome: | The proposed architecture consistently improves performance on four datasets characteristic of different domains and meaning representations. |
Towards Collaborative Neural-Symbolic Graph Semantic Parsing via Uncertainty (2022.findings-acl)
Copied to clipboard
| Challenge: | Recent work in task-independent graph semantic parsing has shifted from symbolic approaches to neural models, showing strong performance on different types of meaning representations. |
| Approach: | They propose a framework that incorporates prior knowledge from a symbolic parser into a decision criterion for beam search to address these limitations. |
| Outcome: | The proposed framework improves on the in-distribution test set but degrades significantly on long-tail situations while the symbolic parser performs more robustly. |
Semantics as a Foreign Language (D18-1)
Copied to clipboard
| Challenge: | (2017): Syntactic grammars capture propositions, but graph-based representations aim to capture a wider notion of propositions. |
| Approach: | They propose a neural sequence-to-sequence framework which can recover syntactic linearizations by a sequence-based approach. |
| Outcome: | The proposed framework performs almost on-par with previous state-of-the-art approaches while requiring less parallel training annotations. |