We first present a basic greedy algorithm that relaxes the global graph-based objective (Section 3).
as this simple algorithm does not provide a realistic estimation of the impact of an arc selection on uncompleted high-order structures in the partial parse forest, it is not competitive with state of the art approximations.