Parsing for Semidirectional Lambek Grammar is NP-Complete

Details Parsing for Semidirectional Lambek Grammar is NP-Complete Parsing for Semidirectional Lambek Grammar is NP-Complete

1996-05-10

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

Proceedings ACL '96 (Santa Cruz)

Computer Science

Computation and Language

7 pages, LaTeX source (uses aclap.sty, tree-dvips.{sty,pro})

Scientific paper

We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call {\em semidirectional}. In semidirectional Lambek calculus $\SDL$ there is an additional non-directional abstraction rule allowing the formula abstracted over to appear anywhere in the premise sequent's left-hand side, thus permitting non-peripheral extraction. $\SDL$ grammars are able to generate each context-free language and more than that. We show that the parsing problem for semidirectional Lambek Grammar is NP-complete by a reduction of the 3-Partition problem.

Affiliated with

Also associated with

No associations

Rating

Parsing for Semidirectional Lambek Grammar is NP-Complete 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 for Semidirectional Lambek Grammar is NP-Complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parsing for Semidirectional Lambek Grammar is NP-Complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521336