On the complexity of non-projective data-driven dependency parsing

  • Authors:
  • Ryan McDonald;Giorgio Satta

  • Affiliations:
  • Google Inc., New York, NY;University of Padua, Padova, Italy

  • Venue:
  • IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we investigate several non-projective parsing algorithms for dependency parsing, providing novel polynomial time solutions under the assumption that each dependency decision is independent of all the others, called here the edge-factored model. We also investigate algorithms for non-projective parsing that account for nonlocal information, and present several hardness results. This suggests that it is unlikely that exact non-projective dependency parsing is tractable for any model richer than the edge-factored model.