Distilling an Ensemble of Greedy Dependency Parsers into One MST Parser

By A. Kuncoro, Miguel Ballesteros, Lingpeng Kong, Chris Dyer, Noah A. Smith. 2016

77 citations recorded by the source corpus.

We introduce two first-order graph-based dependency parsers achieving a new state of the art. The first is a consensus parser built from an ensemble of independently trained greedy LSTM transition-based parsers with different random initializations. We cast this approach as minimum Bayes risk decoding (under the Hamming cost) and argue that weaker consensus within the ensemble is a useful signal of difficulty or ambiguity. The second parser is a "distillation" of the ensemble into a single model. We train the distillation parser using a structured hinge loss objective with a novel cost that incorporates ensemble uncertainty estimates for each possible attachment, thereby avoiding the intractable cross-entropy computations required by applying standard distillation objectives to problems with structured outputs. The first-order distillation parser matches or surpasses the state of the art on English, Chinese, and German.

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. Graham Neubig
  3. Jianfeng Gao
  4. Noah A. Smith
  5. Luke S. Zettlemoyer
  6. Zhe Gan
  7. Furu Wei
  8. Yejin Choi

In Natural Language Processing

  1. Graham Neubig
  2. Mohit Bansal
  3. Noah A. Smith
  4. Christopher D. Manning
  5. Furu Wei
  6. Jianfeng Gao
  7. Luke S. Zettlemoyer
  8. Chris Dyer

Citations in the corpus