AMR Parsing using Stack-LSTMs

07/24/2017
by   Miguel Ballesteros, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2017

Arc-Standard Spinal Parsing with Stack-LSTMs

We present a neural transition-based parser for spinal trees, a dependen...
research
12/15/2016

Transition-based Parsing with Context Enhancement and Future Reward Reranking

This paper presents a novel reranking model, future reward reranking, to...
research
07/18/2016

Dependency Language Models for Transition-based Dependency Parsing

In this paper, we present an approach to improve the accuracy of a stron...
research
05/31/2019

Rewarding Smatch: Transition-Based AMR Parsing with Reinforcement Learning

Our work involves enriching the Stack-LSTM transition-based AMR parser (...
research
06/29/2016

Greedy, Joint Syntactic-Semantic Parsing with Stack LSTMs

We present a transition-based parser that jointly produces syntactic and...
research
03/11/2016

Training with Exploration Improves a Greedy Stack-LSTM Parser

We adapt the greedy Stack-LSTM dependency parser of Dyer et al. (2015) t...
research
06/01/2021

Replicating and Extending "Because Their Treebanks Leak": Graph Isomorphism, Covariants, and Parser Performance

Søgaard (2020) obtained results suggesting the fraction of trees occurri...

Please sign up or login with your details

Forgot password? Click here to reset