AMR-to-text Generation with Synchronous Node Replacement Grammar

02/01/2017
by   Linfeng Song, et al.
0

This paper addresses the task of AMR-to-text generation by leveraging synchronous node replacement grammar. During training, graph-to-string rules are learned using a heuristic extraction algorithm. At test time, a graph transducer is applied to collapse input AMRs and generate output sentences. Evaluated on SemEval-2016 Task 8, our method gives a BLEU score of 25.62, which is the best reported so far.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2022

R2D2: Robust Data-to-Text with Replacement Detection

Unfaithful text generation is a common problem for text generation syste...
research
01/29/2020

Modeling Global and Local Node Contexts for Text Generation from Knowledge Graphs

Recent graph-to-text models generate text from graph-based data using ei...
research
06/16/2020

Modeling Graph Structure via Relative Position for Better Text Generation from Knowledge Graphs

We present a novel encoder-decoder architecture for graph-to-text genera...
research
02/12/2021

Structural Information Preserving for Graph-to-Text Generation

The task of graph-to-text generation aims at producing sentences that pr...
research
02/11/2019

Edge Replacement Grammars: A Formal Language Approach for Generating Graphs

Graphs are increasingly becoming ubiquitous as models for structured dat...
research
03/12/2021

Constrained Text Generation with Global Guidance – Case Study on CommonGen

This paper studies constrained text generation, which is to generate sen...
research
03/21/2023

Dynamic Vertex Replacement Grammars

Context-free graph grammars have shown a remarkable ability to model str...

Please sign up or login with your details

Forgot password? Click here to reset