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

Outline of the Algorithm
Initialize the chart C with items of the form
[α, 0, la, 0, −, −, 0, ⊥], where α ∈ I , root label S.
Then use 4 types of operations to add new items to C:
Scan, Predict, Complete, Adjoin
Operations stated as inference rules:
item 1 · · · item m
item ∗
conditions
Add item ∗ to C if item 1 ,· · ·, item m ∈ C and conditions are met.
Accept input string c 1 · · · c n if C contains at least one item
[α, 0, ra, 0, −, −, n, ⊥], where α ∈ I , root label S.
36 / 52