1 Dependency parsing is typically guided by parameterized scoring functions that involve rich features exerting refined control over the choice of parse trees.
finding the highest scoring parse tree is a provably hard combinatorial inference problem (McDonald and Pereira, 2006).