Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time

Abstract

We present a new cubic-time algorithm to calculate the optimal next step in shift-reduce dependency parsing, relative to ground truth, commonly referred to as `dynamic oracle'. Unlike existing algorithms, it is applicable if the training corpus contains non-projective structures.

We then show that for a projective training corpus, the time complexity can be improved from cubic to linear.