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. |
Similar Papers
A Tree-based Decoder for Neural Machine Translation (D18-1)
Copied to clipboard
| Challenge: | Existing work on adding syntactic information to NMT systems is limited to linguistically-inspired tree structures. |
| Approach: | They propose an NMT model that can naturally generate the topology of an arbitrary tree structure on the target side. |
| Outcome: | The proposed model outperforms standard seq2seq models by 2.1 BLEU points and other methods for incorporating target-side syntax by 0.7 BLUE points. |
Top-down Tree Structured Decoding with Syntactic Connections for Neural Machine Translation and Parsing (D18-1)
Copied to clipboard
| Challenge: | Neural machine translation (NMT) models are based on sequential decoding or serialisation of structured data into sequence. |
| Approach: | They propose a model that combines sequential encoder with tree-structured decoding augmented with a syntax-aware attention model. |
| Outcome: | The proposed model produces fluent translations with better reordering than previous models. |
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%. |
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. |
A Graph-Based Neural Model for End-to-End Frame Semantic Parsing (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies focus on frame semantic parsing as a graph construction problem. |
| Approach: | They propose an end-to-end neural model to tackle frame semantic parsing jointly. |
| Outcome: | The proposed model is highly competitive and performs better than pipeline models on two benchmark datasets. |
Graph-to-Tree Learning for Solving Math Word Problems (2020.acl-main)
Copied to clipboard
| Challenge: | Existing tree-based neural models do not capture the relationships and order information among the quantities well. |
| Approach: | They propose a novel deep learning architecture that combines the merits of the graph-based encoder and tree-based decoder to generate better solution expressions. |
| Outcome: | The proposed framework outperforms the state-of-the-art on two available datasets significantly. |
Graph-to-Sequence Learning using Gated Graph Neural Networks (P18-1)
Copied to clipboard
| Challenge: | Existing approaches to graph-to-sequence learning ignore the full graph structure, discarding key information. |
| Approach: | They propose a graph-to-sequence learning model that encodes the full graph structure and an input transformation that allows nodes and edges to have their own hidden representations. |
| Outcome: | The proposed model outperforms baselines in generation from AMR graphs and syntax-based neural machine translation while retaining the full graph structure. |
An Edge-Enhanced Hierarchical Graph-to-Tree Network for Math Word Problem Solving (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work on graph neural networks to capture word relationships neglects the rest of the problem. |
| Approach: | They propose an edge-enhanced hierarchical graph encoder to incorporate edge label information. |
| Outcome: | The proposed model can improve performance on the MAWPS and Math23K datasets compared with state-of-the-art methods. |
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. |
On Tree-Based Neural Sentence Modeling (D18-1)
Copied to clipboard
| Challenge: | Existing tree-based sentence modeling approaches adopt syntactic parsing trees as the explicit structure prior. |
| Approach: | They replace parsing trees with trivial trees to study their effectiveness . they found that tree-based sentence modeling gives better results when crucial words are closer to the final representation . |
| Outcome: | The proposed tree-based sentences have shown better results on many downstream tasks. |