In the projective (arc-standard) case, subtrees that are in the buffer can be completely reduced.
each oracle step always combines an inferred entry in the table with either a node from the stack or a node from the reduced buffer, asymptotically reducing the time complexity.