Decidable Class of TAGs
task
ID: decidableclassoftags
Related Papers
Capturing CFLs with Tree Adjoining Grammars
We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LC, …...