Rewarding Smatch: Transition-Based AMR Parsing with Reinforcement Learning
arXiv:1905.13370
Abstract
Our work involves enriching the Stack-LSTM transition-based AMR parser (Ballesteros and Al-Onaizan, 2017) by augmenting training with Policy Learning and rewarding the Smatch score of sampled graphs. In addition, we also combined several AMR-to-text alignments with an attention mechanism and we supplemented the parser with pre-processed concept identification, named entities and contextualized embeddings. We achieve a highly competitive performance that is comparable to the best published results. We show an in-depth study ablating each of the new components of the parser
arXiv commentAccepted as short paper at ACL 2019
References in corpus (8)
- A Deep Reinforced Model for Abstractive Summarization
- Transition-Based Dependency Parsing with Stack Long Short-Term Memory
- DyNet: The Dynamic Neural Network Toolkit
- Weakly Supervised Cross-Lingual Named Entity Recognition via Effective Annotation and Representation Projection
- Neural Semantic Parsing by Character-based Translation: Experiments with Abstract Meaning Representations
- Neural Cross-Lingual Entity Linking
- AMR Parsing as Sequence-to-Graph Transduction
- Supervised Syntax-based Alignment between English Sentences and Abstract Meaning Representation Graphs