Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

AMR Parsing with Action-Pointer Transformer

About

Abstract Meaning Representation parsing is a sentence-to-graph prediction task where target nodes are not explicitly aligned to sentence tokens. However, since graph nodes are semantically based on one or more sentence tokens, implicit alignments can be derived. Transition-based parsers operate over the sentence from left to right, capturing this inductive bias via alignments at the cost of limited expressiveness. In this work, we propose a transition-based system that combines hard-attention over sentences with a target-side action pointer mechanism to decouple source tokens from node representations and address alignments. We model the transitions as well as the pointer mechanism through straightforward modifications within a single Transformer architecture. Parser state and graph structure information are efficiently encoded using attention heads. We show that our action-pointer approach leads to increased expressiveness and attains large gains (+1.6 points) against the best transition-based AMR parser in very similar conditions. While using no graph re-categorization, our single model yields the second best Smatch score on AMR 2.0 (81.8), which is further improved to 83.4 with silver data and ensemble decoding.

Jiawei Zhou, Tahira Naseem, Ram\'on Fernandez Astudillo, Radu Florian• 2021

Related benchmarks

TaskDatasetResultRank
AMR parsingLDC2017T10 AMR 2.0 (test)
Smatch83.4
168
AMR parsingAMR 1.0 (test)
Smatch79.8
45
AMR parsingAMR 3.0 (test)
SMATCH81.2
45
AMR parsingBio
Smatch51.23
8
AMR parsingNew3
Smatch71.06
8
AMR parsingLittle Prince
Smatch75.21
8
Showing 6 of 6 rows

Other info

Code

Follow for update