In this model, a dependency h → d is constructed using a purely bottom-up strategy if it represents a left-arc, that is, if the dependent d is placed to the left of the head h in the input string.
furthermore, it is not meaningful to associate transitions la k and ra k , for any k ≥ 1, always with the same features, since the constructed arcs impinge on nodes at different depths in the involved spines.