The graph-based approach employs Eisner and Satta (1999)'s algorithm where spurious ambiguities are eliminated by the notion of split head automaton grammars (Alshawi, 1996).
the arc-standard transition-based parser has the spurious ambiguity problem.