Generative Incremental Dependency Parsing with Neural Networks

By Jan Buys, Phil Blunsom. 2015

19 citations recorded by the source corpus.

We propose a neural network model for scalable generative transition-based dependency parsing. A probability distribution over both sentences and transition sequences is parameterised by a feedforward neural network. The model surpasses the accuracy and speed of previous generative dependency parsers, reaching 91.1% UAS. Perplexity results show a strong improvement over n-gram language models, opening the way to the efficient integration of syntax into neural models for language generation.

Subfields: Artificial Intelligence, Natural Language Processing

How researchers see this paper

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

In Artificial Intelligence

  1. Mohit Bansal
  2. Noah A. Smith
  3. Graham Neubig
  4. Yejin Choi
  5. Luke S. Zettlemoyer
  6. Yoav Goldberg
  7. Chris Dyer
  8. Alexander M. Rush

In Natural Language Processing

  1. Noah A. Smith
  2. Graham Neubig
  3. Mohit Bansal
  4. Chris Dyer
  5. Yoav Goldberg
  6. Yejin Choi
  7. Alexander M. Rush
  8. Luke S. Zettlemoyer

Citations in the corpus