Algorithms for Deterministic Incremental Dependency Parsing

8 Conclusion

1. What are Nivre’s main conclusions about deterministic dependency parsing algorithms?
   All four algorithms give competitive, near state-of-the-art accuracy. The ability to produce non-projective graphs improves accuracy unless all structures are projective, and the non-projective list-based algorithm does so more stably than pseudo-projective parsing, often just as fast. Arc-eager vs arc-standard shows language- and annotation-specific effects.
   • Nivre, 2008, Algorithms for Deterministic Incremental Dependency Parsing (Computational Linguistics), §8, pp. 550–551