Restrictions on Tree Adjoining Languages

Details Restrictions on Tree Adjoining Languages Restrictions on Tree Adjoining Languages

1998-10-13

arxiv.org/abs/cs/9810015v1

Proceedings of COLING-ACL'98

Computer Science

Computation and Language

7 pages LaTeX + 5 eps figures

Scientific paper

Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n^6) worst case running time. In this paper we investigate which restrictions on TAGs and TAG derivations are needed in order to lower this O(n^6) time complexity, without introducing large runtime constants, and without losing any of the generative power needed to capture the syntactic constructions in natural language that can be handled by unrestricted TAGs. In particular, we describe an algorithm for parsing a strict subclass of TAG in O(n^5), and attempt to show that this subclass retains enough generative power to make it useful in the general case.

Affiliated with

Also associated with

No associations

Rating

Restrictions on Tree Adjoining Languages 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 Restrictions on Tree Adjoining Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restrictions on Tree Adjoining Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-235957