Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor...

Recognizing Adjunction
But the algorithm never builds derived trees! It only uses the
elementary trees of the input grammar.
Suppose that the following adjunction took place:
A
A
=
A
(α) (β) (γ) w 1 w 5
A
A
w 1 w 3 w 5 w 2 w w 4 2 w 4
w 3
We need to traverse the derived tree γ but only have α and β at
our disposal.
31 / 52