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

Extending Recognizer to a Parser
Recognizer can be easily extended to a parser by
remembering why items were placed into the chart.
We can use items of the form
[γ, adr, pos, i, j, k, l, adj, P ]
where P is a set of pointers/pairs of pointers to items which
caused the item to exist.
Results in a graph of all possible derivations.
Time complexity remains the same, i.e. O(n 6 ).
44 / 52