Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor...
Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor...
Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Recognizing Substitution<br />
Recognizer can be extended by two rules for substitution:<br />
Predict Subst :<br />
Substitute :<br />
[γ, <strong>ad</strong>r, lb, i, −, −, i, ⊥]<br />
[α, 0, la, i, −, −, i, ⊥]<br />
[α, 0, ra, i, −, −, l, ⊥]<br />
[γ, <strong>ad</strong>r, rb, i, −, −, l, ⊥]<br />
α ∈ SS(γ, <strong>ad</strong>r)<br />
α ∈ SS(γ, <strong>ad</strong>r)<br />
SS(γ, <strong>ad</strong>r) ⊆ I : set of trees substitutable at node (γ, <strong>ad</strong>r),<br />
empty if (γ, <strong>ad</strong>r) not a substitution node<br />
Time complexity remains the same, i.e. O(n 6 ).<br />
45 / 52
Change language