, {α x } Label(α x @a) = ε Foot Axiom α x @a • , i, j, k, l, Λ α x @a • , i, j, k, l, Λ Figure 6: Axioms and inference rules for the CKY algorithm for delayed TL-MCTAG with a delay of d. lay list, giving a total number of active delay lists of O(|G| t(1+d(f −1)) ).
we note that in order to allow a non-total ordering of the trees in a vector we would simply have to record all trees in a tree vector in the histories as is done in the delayed TL-MCTAG parser.