Expand description

This crate provides (de)projectivizers for universal dependency graphs.

A non-projective graph is a graph with crossing edges when the words/vertices are laid out in sentence order. A projective graph does not have crossing edges. This crate provides projectivizers, which can rewrite non-projective graphs into a projective graphs. The corresponding deprojectivizers can be used to reverse this transformation.


A projectivizer using the ‘head’-marking strategy. See: Pseudo-Projective Dependency Parsing, Nivre and Nilsson, 2005.


Graph errors.


Graph deprojectivizer.

Graph projectivizer.