That is, we now only have a polynomial number of constraints corresponding to each word pair in (5), rather than the exponential number over every possible parse tree in (4).
we obtain a polynomial size quadratic program that can be solved for moderately large problems using standard software packages.