Lightweight, Dynamic Graph Convolutional Networks for AMR-to-Text Generation (2020.emnlp-main)
Copied to clipboard
| Challenge: | AMR-to-text generation is used to transduce Abstract Meaning Representation structures (AMRs) Graph Convolution Networks (GCNs) are not able to capture non-local information and follow a local (first-order) information aggregation scheme. |
| Approach: | They propose a dynamic fusion mechanism that captures richer non-local interactions . they propose weight tied convolutions and group graph convolution to reduce memory usage . |
| Outcome: | The proposed model outperforms state-of-the-art models on two benchmark datasets with significantly fewer parameters while maintaining the model capacity. |
Similar Papers
AMR-To-Text Generation with Graph Transformer (2020.tacl-1)
Copied to clipboard
| Challenge: | Abstract meaning representation (AMR)-to-text generation is challenging task for natural language processing. |
| Approach: | They propose a graph-to-sequence model that directly encodes AMR graphs and learns node representations. |
| Outcome: | The proposed model outperforms the current state-of-the-art neural approach by 1.5 BLEU points on LDC2015E86 and 4.8 BLUE points on the LDC2017T10 and achieves new state- of-the art performance. |
A Graph-to-Sequence Model for AMR-to-Text Generation (P18-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) is a semantic formalism that encodes the meaning of a sentence as a rooted, directed graph. |
| Approach: | They propose a neural graph-to-sequence model that leverages LSTM to encode a linearized AMR structure. |
| Outcome: | The proposed model outperforms existing methods on a benchmark. |
Line Graph Enhanced AMR-to-Text Generation with Mix-Order Graph Attention Networks (2020.acl-main)
Copied to clipboard
| Challenge: | Existing graph-to-sequence approaches use graph neural networks as encoders, but they lack the structure information needed to translate AMR into the graph-based data. |
| Approach: | They propose a graph-to-sequence task which aims to recover natural language from Abstract Meaning Representations (AMR) they adopt graph attention networks with higher-order neighborhood information to explore the edge relations in AMR graphs. |
| Outcome: | The proposed framework achieves state-of-the-art performance on English AMR benchmark datasets and is able to translate the AMR semantics into the natural language. |
Online Back-Parsing for AMR-to-Text Generation (2020.emnlp-main)
Copied to clipboard
| Challenge: | Abstract meaning representation (AMR) is a semantic graph representation that abstracts meaning away from a sentence. |
| Approach: | They propose a decoder that back predicts projected AMR graphs on target sentences . their results show superiority over previous state-of-the-art decoded graph Transformer . |
| Outcome: | The proposed model outperforms the state-of-the-art model on two AMR benchmarks. |
Structural Neural Encoders for AMR-to-text Generation (N19-1)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) graphs are graphs, rather than trees, because they contain reentrant nodes with multiple parents. |
| Approach: | They propose to use sequence-to-sequence models that encode AMR graphs into vector representations to generate sentences from AMRs. |
| Outcome: | The proposed model outperforms tree encoders in the AMR-to-text generation task by 24.40 points. |
Modeling Graph Structure in Transformer for Better AMR-to-Text Generation (D19-1)
Copied to clipboard
| Challenge: | Recent studies on AMR-to-text generation formalize the task as a sequence-tosequence learning problem . previous approaches only consider the relations between directly connected concepts while ignoring the rich structure in AMR graphs. |
| Approach: | They propose a structure-aware self-attention approach to model the relations between indirectly connected concepts in the seq2seq model. |
| Outcome: | The proposed approach outperforms the state-of-the-art on English AMR benchmarks . it significantly outperformed the state of the art on the benchmarks, with 29.66 and 31.82 BLEU scores . |
Graph Pre-training for AMR Parsing and Generation (2022.acl-long)
Copied to clipboard
| Challenge: | Abstract meaning representation (AMR) highlights the core semantic information of text in a graph structure. |
| Approach: | They propose two graph auto-encoding strategies for graph-to-graph pre-training and four tasks to integrate text and graph information during pre-tuning to improve structure awareness. |
| Outcome: | The proposed model is superior to pre-trained language models on AMR parsing and AMR-to-text generation tasks. |
Structural Information Preserving for Graph-to-Text Generation (2020.acl-main)
Copied to clipboard
| Challenge: | Existing models that mess up or drop the core structural information of input graphs are lacking in graph-to-text generation. |
| Approach: | They propose to leverage richer training signals to guide a graph-to-text generation model by focusing on autoencoding losses and back-propagating the losses to better calibrate the model. |
| Outcome: | Experiments on two benchmarks show the proposed model over a state-of-the-art model . two types of autoencoding losses are used to back-propagate the model based on multitask training . |
Multi-hop Graph Convolutional Network with High-order Chebyshev Approximation for Text Reasoning (2021.acl-long)
Copied to clipboard
| Challenge: | Existing single-hop graph reasoning in Graph convolutional networks may miss some important non-consecutive dependencies. |
| Approach: | They propose a graph convolutional network with the high-order dynamic Chebyshev approximation which augments multi-hop graph reasoning by fusing messages aggregated from direct and long-term dependencies into one convolutionalist layer. |
| Outcome: | The proposed model improves on four transductive and inductive NLP tasks and the ablation of the existing model. |
Relation Extraction with Word Graphs from N-grams (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies for relation extraction (RE) leverage the dependency tree of the input sentence to improve performance. |
| Approach: | They propose to use a graph convolutional network to build a context graph without dependency parsers. |
| Outcome: | The proposed approach improves neural RE methods without dependency parsers on English benchmark datasets. |