Learnability of pregroup grammars
DOI10.1007/S11225-007-9085-2zbMATH Open1128.68042OpenAlexW2017776337MaRDI QIDQ2467214FDOQ2467214
Authors: Denis Béchet, Annie Foret, Isabelle Tellier
Publication date: 21 January 2008
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00191112/file/bechet-foret-tellier.pdf
Recommendations
constraintsparsingpregroup grammarscomputational linguisticscategorial grammarslearning from positive examples
Computational learning theory (68Q32) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Natural language processing (68T50)
Cites Work
- Language identification in the limit
- Toward discourse representation via pregroup grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Categorial grammars determined from linguistic data by unification
- Title not available (Why is that?)
- Type grammars as pregroups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sequent systems for compact bilinear logic
- Title not available (Why is that?)
- Logical Aspects of Computational Linguistics
- Grammatical Inference: Algorithms and Applications
- Title not available (Why is that?)
- Parsing pregroup grammars and Lambek calculus using partial composition
Cited In (6)
This page was built for publication: Learnability of pregroup grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467214)