Capturing CFLs with Tree Adjoining Grammars
| dc.creator | Rogers, James | |
| dc.date | 1994-05-24 | |
| dc.date | 1994-05-25 | |
| dc.date.accessioned | 2026-07-07T08:58:35Z | |
| dc.date.available | 2026-07-07T08:58:35Z | |
| dc.description | 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 LCFGs of Schabes and Waters but with considerably less restriction on the form of the grammars. The class provides a normal form for TAGs that generate local sets in much the same way that regular grammars provide a normal form for CFGs that generate regular sets. | |
| dc.description | 8 pages, 3 figures. To appear in proceedings of ACL'94 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9405020 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9405020 | |
| dc.identifier | In Proceedings of ACL-94 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/147382 | |
| dc.subject | Computation and Language | |
| dc.title | Capturing CFLs with Tree Adjoining Grammars | |
| dc.type | text |