However, our CKY factorization algorithm will give a factorization with n/2 discontinuous spans in one dimension.
in the worst case, the number of spans found by the cubic-time algorithm grows with n, even when a constant number of spans is possible, implying that there is no approximation ratio on how close the algorithm will get to the optimal solution.