Past work on tree-structured outputs has used constraints for the k-best scoring tree (Mc-Donald et al., 2005b) or even all possible trees by using factored representations (Taskar et al., 2004;McDonald et al., 2005c).
we show in the next section that this robustness extends to approximate dependency parsing.