We consider arc-factored dependency parsing with well-nestedness and bounded block degree constraints.
this reduction is less rewarding and there are many more variables set to 0 than 1 in a MSA solution.