References

  1. Denis Béchet, Annie Foret & Isabelle Tellier (2007): Learnability of Pregroup Grammars. Studia Logica 87(2-3), pp. 225–252, doi:10.1007/s11225-007-9085-2.
  2. Wojciech Buszkowski (1984): A note on the Lambek-van Benthem calculus. Bulletin of the Section of Logic 13(1), pp. 31–35.
  3. Wojciech Buszkowski & Katarzyna Moroz (2008): Pregroup grammars and context-free grammars. Computational Algebraic Approaches to Natural Language, Polimetrica, pp. 1–21.
  4. Bob Coecke, Edward Grefenstette & Mehrnoosh Sadrzadeh (2013): Lambek vs. Lambek: Functorial vector space semantics and string diagrams for Lambek calculus. Ann. Pure Appl. Logic 164(11), pp. 1079–1100, doi:10.1016/j.apal.2013.05.009.
  5. Shay B. Cohen & Noah A. Smith (2010): Viterbi training for PCFGs: Hardness results and competitiveness of uniform initialization. In: In Proc. of ACL.
  6. Colin De La Higuera (2005): A bibliographical study of grammatical inference. Pattern recognition 38(9), pp. 1332–1348, doi:10.1016/j.patcog.2005.01.003.
  7. Antonin Delpeuch & Anne Preller (2014): From Natural Language to RDF Graphs with Pregroups. In: Proceedings of the EACL 2014 Workshop on Type Theory and Natural Language Semantics (TTNLS). Association for Computational Linguistics, Gothenburg, Sweden, pp. 55–62. Available at http://www.aclweb.org/anthology/W14-1407.
  8. Daniela Dudau-Sofronie, Isabelle Tellier & Marc Tommasi (2001): From Logic to Grammars via Types. In: Proceedings of the 3rd Workshop on Learning Language in Logic, pp. 35–46.
  9. Daniela Dudau-Sofronie, Isabelle Tellier & Marc Tommasi (2003): A learnable class of Classical Categorial Grammars from typed examples. In: 8th Conference on Formal Grammar, pp. 77–88.
  10. E Mark Gold (1967): Language identification in the limit. Information and control 10(5), pp. 447–474, doi:10.1016/S0019-9958(67)91165-5.
  11. Edward Grefenstette & Mehrnoosh Sadrzadeh (2011): Experimental Support for a Categorical Compositional Distributional Model of Meaning. In: EMNLP, pp. 1394–1404. Available at http://www.aclweb.org/anthology/D11-1129.
  12. Walter Guttmann & Markus Maucher (2006): Variations on an ordering theme with constraints. In: Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006. Springer, pp. 77–90, doi:10.1007/978-0-387-34735-6_10.
  13. Makoto Kanazawa (1996): Identification in the limit of categorial grammars. Journal of Logic, Language and Information 5(2), pp. 115–155, doi:10.1007/BF00173697.
  14. Richard M Karp (1972): Reducibility among combinatorial problems. Springer, doi:10.1007/978-1-4684-2001-2_9.
  15. J Lambek (2008): Pregroup Grammars and Chomskys Earliest Examples. Journal of Logic, Language and Information 17(2), pp. 141–160, doi:10.1007/s10849-007-9053-2.
  16. Joachim Lambek (1968): Deductive systems and categories. Mathematical Systems Theory 2(4), pp. 287–318, doi:10.1007/bf01703261.
  17. Steven Pinker (2009): Language Learnability and Language Development, With New Commentary by the Author. Harvard University Press.
  18. Anne Preller (2005): Category theoretical semantics for pregroup grammars. In: Logical aspects of computational linguistics. Springer, pp. 238–254, doi:10.1007/11422532_16.
  19. Anne Preller & Joachim Lambek (2007): Free Compact 2-categories. Mathematical. Structures in Comp. Sci. 17(2), pp. 309–340, doi:10.1017/S0960129506005901.
  20. Anne Preller & Mehrnoosh Sadrzadeh (2011): Semantic Vector Models and Functional Models for Pregroup Grammars. Journal of Logic, Language and Information 20(4), pp. 419–443, doi:10.1007/s10849-011-9132-2.
  21. Peter Selinger (2010): Autonomous categories in which A ~eq A*. In: Proceedings of the 7th International Workshop on Quantum Physics and Logic (QPL 2010), Oxford, pp. 151–160.
  22. Peter Selinger (2011): A survey of graphical languages for monoidal categories. In: New Structures for Physics, Lecture Notes in Physics 813. Springer, pp. 289–233, doi:10.1007/978-3-642-12821-9_4.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org