We gratefully acknowledge support from
the Simons Foundation
and member institutions
Full-text links:


Current browse context:

new | recent | 1404

Change to browse by:

References & Citations

DBLP - CS Bibliography

Computer Science > Computation and Language

Title:Complexity of Grammar Induction for Quantum Types

Abstract: Most categorical models of meaning use a functor from the syntactic category to the semantic category. When semantic information is available, the problem of grammar induction can therefore be defined as finding preimages of the semantic types under this forgetful functor, lifting the information flow from the semantic level to a valid reduction at the syntactic level. We study the complexity of grammar induction, and show that for a variety of quantum type systems, including pivotal and compact closed categories, the grammar induction problem is NP-complete. Our approach could be extended to linguistic type systems such as autonomous or bi-closed categories.
Comments: Submitted to QPL 2014
Subjects: Computation and Language (cs.CL); Category Theory (math.CT)
Cite as: arXiv:1404.3925 [cs.CL]
  (or arXiv:1404.3925v1 [cs.CL] for this version)

Submission history

From: Antonin Delpeuch [view email]
[v1] Sun, 13 Apr 2014 14:19:27 UTC (16 KB)
[v2] Tue, 30 Dec 2014 03:02:40 UTC (26 KB)