Unlike modern approximation algorithms for our problem, our algorithm is greedy and deterministic.
in each iteration it selects an arc to be included in its final dependency tree and this decision cannot be changed in subsequent iterations.