Type-Logical and Hyperedge Replacement Grammars
Résumé
This article gives a much more detailed account of my TAG+ paper. It identifies fragments of the multimodal Lambek calculus and the Lambek-Grishin calculus for which we can have polynomial parsing by giving a hyperedge replacement grammar for proof nets in these fragments.
Domaines
Informatique et langage [cs.CL]
Origine : Fichiers produits par l'(les) auteur(s)