Training with Exploration Improves a Greedy Stack-LSTM Parser

11 Mar 2016  ·  Miguel Ballesteros, Yoav Goldberg, Chris Dyer, Noah A. Smith ·

We adapt the greedy Stack-LSTM dependency parser of Dyer et al. (2015) to support a training-with-exploration procedure using dynamic oracles(Goldberg and Nivre, 2013) instead of cross-entropy minimization. This form of training, which accounts for model predictions at training time rather than assuming an error-free action history, improves parsing accuracies for both English and Chinese, obtaining very strong results for both languages. We discuss some modifications needed in order to get training with exploration to work well for a probabilistic neural-network.

PDF Abstract

Datasets


Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Chinese Dependency Parsing Chinese Pennbank Ballesteros et al. (2016) LAS 86.21 # 2
UAS 87.65 # 3
Dependency Parsing Penn Treebank Arc-hybrid POS 97.3 # 5
UAS 93.56 # 21
LAS 91.42 # 21

Methods


No methods listed for this paper. Add relevant methods here