Deep Biaffine Attention for Neural Dependency Parsing

By Timothy Dozat, Christopher D. Manning. 2016

1,337 citations recorded by the source corpus.

This paper builds off recent work from Kiperwasser & Goldberg (2016) using neural attention in a simple graph-based dependency parser. We use a larger but more thoroughly regularized parser than other recent BiLSTM-based approaches, with biaffine classifiers to predict arcs and labels. Our parser gets state of the art or near state of the art performance on standard treebanks for six different languages, achieving 95.7% UAS and 94.1% LAS on the most popular English PTB dataset. This makes it the highest-performing graph-based parser on this benchmark---outperforming Kiperwasser Goldberg (2016) by 1.8% and 2.2%---and comparable to the highest performing transition-based parser (Kuncoro et al., 2016), which achieves 95.8% UAS and 94.6% LAS. We also show which hyperparameter choices had a significant effect on parsing accuracy, allowing us to achieve large gains over other graph-based approaches.

Subfields: Natural Language Processing, Model Architectures

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Natural Language Processing

  1. Mohit Bansal
  2. Graham Neubig
  3. Luke S. Zettlemoyer
  4. Percy Liang
  5. Noah A. Smith
  6. Yejin Choi
  7. Christopher D. Manning
  8. Jonathan Berant

In Model Architectures

  1. Graham Neubig
  2. Noah A. Smith
  3. Yoav Goldberg
  4. Christopher D. Manning
  5. Iryna Gurevych
  6. Richard Socher
  7. Quoc V. Le
  8. Caiming Xiong

Citations in the corpus