Our formulation uses a factorization analogous to the standard dynamic programs for parsing.
it allows one to efficiently learn a model which discriminates among the entire space of parse trees, as opposed to reranking the top few candidates.