Skip to main navigation menu Skip to main content Skip to site footer

Efficient Structured Inference for Transition-Based Parsing with Neural Networks and Error States

Abstract

Transition-based approaches based on local classification are attractive for dependency parsing due to their simplicity and speed, despite producing results slightly below the state-of-the-art. In this paper, we propose a new approach for approximate structured inference for transition-based parsing that produces scores suitable for global scoring using local models. This is accomplished with the introduction of error states in local training, which add information about incorrect derivation paths typically left out completely in locally-trained models. Using neural networks for our local classifiers, our approach produces the highest accuracy for transition-based dependency parsing in English.

PDF (presented at NAACL 2016)