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 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. ; Comment: In Proceedings QPL 2014, arXiv:1412.8102
Keywords : dissemin
Type de document :
Article dans une revue
Electronic Proceedings in Theoretical Computer Science, EPTCS, 2014, 172, pp.236-248. 〈10.4204/eptcs.172.16〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01481758
Contributeur : Projet Dissemin <>
Soumis le : jeudi 2 mars 2017 - 19:47:39
Dernière modification le : mercredi 8 mars 2017 - 09:09:43
Document(s) archivé(s) le : mercredi 31 mai 2017 - 16:52:23

Fichier

article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Antonin Delpeuch. Complexity of Grammar Induction for Quantum Types. Electronic Proceedings in Theoretical Computer Science, EPTCS, 2014, 172, pp.236-248. 〈10.4204/eptcs.172.16〉. 〈hal-01481758〉

Partager

Métriques

Consultations de la notice

36

Téléchargements de fichiers

17