Parsing Free Word-Order Languages in Polynomial Time

Details Parsing Free Word-Order Languages in Polynomial Time Parsing Free Word-Order Languages in Polynomial Time

1994-11-03

arxiv.org/abs/cmp-lg/9411008v1

In {\em 3e Colloque International sur les Grammaires d'Arbres Adjoints (TAG+3)}

Computer Science

Computation and Language

4 pages, uuencoded compressed ps file

Scientific paper

We present a parsing algorithm with polynomial time complexity for a large
subset of V-TAG languages. V-TAG, a variant of multi-component TAG, can handle
free-word order phenomena which are beyond the class LCFRS (which includes
regular TAG). Our algorithm is based on a CYK-style parser for TAGs.

Affiliated with

Also associated with

No associations

Rating

Parsing Free Word-Order Languages in Polynomial Time 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 Parsing Free Word-Order Languages in Polynomial Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parsing Free Word-Order Languages in Polynomial Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-569872