Cited by 380Advanced Graph Neural NetworksTopic ModelingNatural Language Processing Techniques

Graph-to-Sequence Learning using Gated Graph Neural Networks

Open access
Beck, Daniel, Haffari, Gholamreza, Cohn, Trevor·2018·Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)

Abstract

Many NLP applications can be framed as a graph-to-sequence learning problem. Previous work proposing neural architectures on graph-to-sequence obtained promising results compared to grammar-based approaches but still rely on linearisation heuristics and/or standard recurrent networks to achieve the best performance. In this work propose a new model that encodes the full structural information contained in the graph. Our architecture couples the recently proposed Gated Graph Neural Networks with an input transformation that allows nodes and edges to have their own hidden representations, while tackling the parameter explosion problem present in previous work. Experimental results shows that our model outperforms strong baselines in generation from AMR graphs and syntax-based neural machine translation.

Integrity signals

Registry

Crossref · 10.18653/v1/p18-1026

Cites

45 of 45 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

The text we found for this paper looks like another document, so its claims and self-check weren’t run. The registry and citation checks still apply.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The text we found for this paper looks like another document, so the self-check wasn’t run.

Cites

Flagged first, then by citations

2 of the 47 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Beck, D., Haffari, G., & Cohn, T.
Affiliations
  • The University of Melbourne (AU)
  • Monash University (AU)
Venue
Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Published
2018
Pages
273-283
ISSN
0736-587X (ISSN-L)
OpenAlex
W2798749466
Cited by
380
References
47
Citations by year
2026: 7 · 2025: 16 · 2024: 20 · 2023: 47 · 2022: 62 · 2021: 102 · 2020: 67 · 2019: 56 · 2018: 3
FWCI
23.27
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
Proceedings of the conference - Association for Computational Linguistics. Meeting (publishedVersion, cc-by)
Funders
  • Johns Hopkins University
  • Carnegie Mellon University
  • Australian Research Council (DP160102686)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
gated graph neural networks, graph neural networks, semantic parsing

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review