Paper: Capturing CFLs With Tree Adjoining Grammars

ACL ID P94-1022
Title Capturing CFLs With Tree Adjoining Grammars
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1994

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, FGs of Schabes and Waters but with consider- ably less restriction on the form of the grammars. The class provides a nornlal form for TAGs that generate local sets m rnuch the same way that regular grammars provide a normal form for CFGs that generate regular sets.