Challenge: Pretrained language models (PLMs) have advanced graph-to-text generation, but efficient encoding of graph structure is challenging because of the nature of the data.
Approach: They propose a method to encode graph structure into pretrained language models by training only graph structure-aware adapter parameters.
Outcome: The proposed method outperforms the state-of-the-art on two AMR-to-text datasets, training only 5.1% of the adapter parameters.

Similar Papers

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.
Investigating the Effect of Relative Positional Embeddings on AMR-to-Text Generation with Structural Adapters (2023.eacl-main)

Copied to clipboard

Challenge: Recent approaches to text generation from Abstract Meaning Representation (AMR) have been based on neural-centered encoderdecoder architectures.
Approach: They propose a structure-aware adapter which injects the input graph connectivity within PLMs using Graph Neural Networks.
Outcome: The proposed adapter is robust to a variety of approaches and can be used to generate Graph-to-Text representations.
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.
Incorporating Graph Information in Transformer-based AMR Parsing (2023.findings-acl)

Copied to clipboard

Challenge: Abstract Meaning Representation (AMR) is a semantic graph abstraction for text representations.
Approach: They propose a model and method that incorporates graph information into the learned representations of AMR by word-to-node alignment.
Outcome: The proposed model improves AMR parsing performance by embedding graph information into the encoder at training time.
Leveraging AMR Graph Structure for Better Sequence-to-Sequence AMR Parsing (2024.lrec-main)

Copied to clipboard

Challenge: Recent studies on AMR parsing often regard this task as a seq2seq translation problem.
Approach: They propose to translate AMR graphs into AMR token sequences in pre-processing and recover AMR from sequences after decoding.
Outcome: The proposed approach outperforms baseline and achieves 85.5 0.1 and 84.2 0.2 Smatch scores on AMR 2.0 and AMR 3.0.
Enhancing Structure-aware Encoder with Extremely Limited Data for Graph-based Dependency Parsing (2022.coling-1)

Copied to clipboard

Challenge: Dependency parsing is an important natural language processing task which analyzes the syntactic structure of an input sentence.
Approach: They propose a structure-aware encoder pre-trained on auto-parsed data to improve dependency parsing . they propose combining gold dependency trees with existing parsers to improve parser performance .
Outcome: The proposed approach outperforms baselines under different parsers and dependency standards under different parameters and model architectures.
Stage-wise Fine-tuning for Graph-to-Text Generation (2021.acl-srw)

Copied to clipboard

Challenge: Graph-to-text generation has benefited from pre-trained language models (PLMs) but they fail to fully utilize the structure information of the input graph.
Approach: They propose a structured graph-to-text model with a two-step fine-tuning mechanism which first fine-tracks model on Wikipedia before adapting to graph- to-text generation.
Outcome: The proposed model improves the performance of the English WebNLG 2017 dataset by using tree-level embeddings to capture the inter-dependency structures of the input graph.
DeepStruct: Pretraining of Language Models for Structure Prediction (2022.findings-acl)

Copied to clipboard

Challenge: Pretrained language models perform structural understanding tasks that focus on understanding one aspect of the text.
Approach: They propose a method for improving the structural understanding abilities of language models by pretraining them to generate structures from the text on task-agnostic corpora.
Outcome: The proposed model performs state-of-the-art on 21 of 28 datasets.
Structure-aware Fine-tuning of Sequence-to-sequence Transformers for Transition-based AMR Parsing (2021.emnlp-main)

Copied to clipboard

Challenge: Recent work shows that pre-trained sequence-to-sequence Transformer models are effective in predicting linearized Abstract Meaning Representation graphs.
Approach: They propose a structure-aware transition-based approach to AMR parsing that integrates general pre-trained sequence-to-sequence language models with a structured transition set.
Outcome: The proposed approach retains the desirable properties of previous approaches while reaching the new parsing state of the art for AMR 2.0.
Self-supervised Graph Masking Pre-training for Graph-to-Text Generation (2022.emnlp-main)

Copied to clipboard

Challenge: Large-scale pre-trained language models (PLMs) have advanced Graph-to-Text generation by processing the linearised version of a graph.
Approach: They propose to mask pre-training tasks that neither require supervision signals nor adjust the architecture of the underlying pre-trained encoder-decoder model.
Outcome: The proposed method achieves state-of-the-art results on WebNLG+2020 and EventNarrative datasets and is very efficient in the low-resource setting.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations