While this yields more involved subproblems (with a quadratic term), we show that exact solutions can still be efficiently computed for all cases of interest, by using sort operations.
we obtain parsers that can handle very rich features, do not require specifying a decomposition, and can be heavily parallelized.