In fact, they prove that TAG cannot even strongly lexicalize the weaker tree insertion grammars (Schabes and Waters, 1995).
formally, the set T Σ (X) of Σ-trees indexed by X is the smallest set T such that X ⊆ T and σ(t 1 , .