Exact inference for dependency parsing can be achieved in cubic time if the model is restricted to projective trees (Eisner, 1996).
nonprojectivity is needed for natural language parsers to satisfactorily deal with linguistic phenomena like topicalization, scrambling and extraposition, which cause crossing dependencies.