An Improved Non-monotonic Transition System for Dependency Parsing

By Matthew Honnibal, Mark Johnson. 2015

648 citations recorded by the source corpus.

Transition-based dependency parsers usually use transition systems that monotonically extend partial parse states until they identify a complete parse tree. Honnibal et al. (2013) showed that greedy onebest parsing accuracy can be improved by adding additional non-monotonic transitions that permit the parser to “repair” earlier parsing mistakes by “over-writing” earlier parsing decisions. This increases the size of the set of complete parse trees that each partial parse state can derive, enabling such a parser to escape the “garden paths” that can trap monotonic greedy transition-based dependency parsers. We describe a new set of non-monotonic transitions that permits a partial parse state to derive a larger set of completed parse trees than previous work, which allows our parser to escape from a larger set of garden paths. A parser with our new nonmonotonic transition system has 91.85% directed attachment accuracy, an improvement of 0.6% over a comparable parser using the standard monotonic arc-eager transitions.

Subfields: Artificial Intelligence, Information Systems, 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. Yejin Choi
  3. Jianfeng Gao
  4. Luke S. Zettlemoyer
  5. Percy Liang
  6. Caiming Xiong
  7. Noah A. Smith
  8. Hannaneh Hajishirzi

In Information Systems

  1. Chitta Baral
  2. Yejin Choi
  3. Devi Parikh
  4. Pratyay Banerjee
  5. Matt Gardner
  6. Alexander J. Ratner
  7. Benjamin Van Durme
  8. Yuxiao Dong

In Natural Language Processing

  1. Yejin Choi
  2. Mohit Bansal
  3. Luke S. Zettlemoyer
  4. Yoav Goldberg
  5. Noah A. Smith
  6. Dan Roth
  7. Hannaneh Hajishirzi
  8. Jonathan Berant

Citations in the corpus