AMR Parsing using Stack-LSTMs

EMNLP 2017  ·  Miguel Ballesteros, Yaser Al-Onaizan ·

We present a transition-based AMR parser that directly generates AMR parses from plain text. We use Stack-LSTMs to represent our parser state and make decisions greedily. In our experiments, we show that our parser achieves very competitive scores on English using only AMR training data. Adding additional information, such as POS tags and dependency trees, improves the results further.

PDF Abstract EMNLP 2017 PDF EMNLP 2017 Abstract
No code implementations yet. Submit your code now

Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
AMR Parsing LDC2014T12 Transition-based parser-Stack-LSTM F1 Full 63 # 11
F1 Newswire 68 # 5

Methods


No methods listed for this paper. Add relevant methods here