When we get to PROJECTIVITY, the quadratic coefficient b is so small that the average running time is practically linear for the great majority of sentences.
the complexity is not much worse for the bounded degrees of non-projectivity (d ≤ 1, d ≤ 2).