Given some derived tree of G, we can then build an incremental derivation of G which first builds an unlexicalized version of the derived tree using substitution and adjunction of prediction trees, and then verifies this derived tree from left to right.
anything that TAG can derive, PLTAG can derive incrementally.