We show that dependency parsers have more difficulty parsing questions than constituency parsers.
deterministic shift-reduce dependency parsers, which are of highest interest for practical applications because of their linear running time, drop to 60% labeled accuracy on a question test set.