Stack-propagation: Improved Representation Learning for Syntax

By David Weiss. 2016

87 citations recorded by the source corpus.

Traditional syntax models typically leverage part-of-speech (POS) information by constructing features from hand-tuned templates. We demonstrate that a better approach is to utilize POS tags as a regularizer of learned representations. We propose a simple method for learning a stacked pipeline of models which we call “stack-propagation”. We apply this to dependency parsing and tagging, where we use the hidden layer of the tagger network as a representation of the input tokens for the parser. At test time, our parser does not require predicted POS tags. On 19 languages from the Universal Dependencies, our method is 1.3% (absolute) more accurate than a state-of-the-art graph-based approach and 2.7% more accurate than the most comparable greedy model.

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. Graham Neubig
  2. Luke S. Zettlemoyer
  3. Noah A. Smith
  4. Mohit Bansal
  5. Yejin Choi
  6. Percy Liang
  7. Jianfeng Gao
  8. Kyunghyun Cho

In Natural Language Processing

  1. Graham Neubig
  2. Luke S. Zettlemoyer
  3. Noah A. Smith
  4. Philipp Koehn
  5. Mohit Bansal
  6. Kyunghyun Cho
  7. Christopher D. Manning
  8. Percy Liang

Citations in the corpus