sentence1: unfortunately , global inference and learning for graph-based dependency parsing is typically np-hard .
sentence2: in general , inference and learning for graph-based dependency parsing is np-hard when the score is factored over anything larger than arcs .