Parsing for Semidirectional Lambek Grammar is NP-Complete
| dc.creator | Doerre, Jochen | |
| dc.date | 1996-05-10 | |
| dc.date.accessioned | 2026-07-07T09:10:16Z | |
| dc.date.available | 2026-07-07T09:10:16Z | |
| dc.description | 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. | |
| dc.description | 7 pages, LaTeX source (uses aclap.sty, tree-dvips.{sty,pro}) | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9605016 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9605016 | |
| dc.identifier | Proceedings ACL '96 (Santa Cruz) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151303 | |
| dc.subject | Computation and Language | |
| dc.title | Parsing for Semidirectional Lambek Grammar is NP-Complete | |
| dc.type | text |