Capturing CFLs with Tree Adjoining Grammars

Details Capturing CFLs with Tree Adjoining Grammars Capturing CFLs with Tree Adjoining Grammars

1994-05-24

arxiv.org/abs/cmp-lg/9405020v2

In Proceedings of ACL-94

Computer Science

Computation and Language

8 pages, 3 figures. To appear in proceedings of ACL'94

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Capturing CFLs with Tree Adjoining Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Capturing CFLs with Tree Adjoining Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capturing CFLs with Tree Adjoining Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494001