Solving the Correct-preex Property for Tags

We present a new upper bound for the computational complexity of the parsing problem for TAGs, under the constraint that input is read from left to right in a way that errors in the input are observed as soon as possible, which is called the correct-preex property. The former upper bound was O(n 9), which we now improve to O(n 6), which is the same as that of practical parsing algorithms for TAGs without the additional constraint of the correct-preex property. Thereby we show that the correct-preex property does not require signiicant additional costs.