Graph-based parsers solve a structured prediction problem in which the goal is learning a scoring function over dependency trees such that correct trees are scored above all others.
hence, the independence assumptions of the BL tagger apparently lead to more 'local' errors such as exact argument span identification (cf.