Skip to main content

Good Types Are Useful for Learning

  • Chapter
Logic and Grammar

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6700))

  • 578 Accesses

Abstract

This paper presents learnability results from Typed Examples for some classes of Lambek Grammars, in the context of Gold’s model of identification in the limit. Typed Examples are semantic information and we show that, as soon as syntax and semantics are connected by some compositional morphism, they allow to learn rich syntactic formalisms. A learning strategy is also presented and exemplified.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bar Hillel, Y., Gaifman, C., Shamir, E.: On Categorial and Phrase Structure Grammars. Bulletin of the Research Council of Israel 9F (1960)

    Google Scholar 

  3. Béchet, D., Bonato, R., Dikovsky, A., Foret, A., Le Nir, Y., Moreau, E., Retoré, C., Tellier, I.: Modéles algorithmiques de l’acquisition de la syntaxe; concepts et méthodes, résultats et problemes, Revue Linguistique de Vincennes, pp. 123–152 (2007)

    Google Scholar 

  4. Béchet, D., Foret, A.: Apprentissage des grammaires de Lambek rigides et d’arité bornée pour le traitement automatique des langues. In: CAP 2003, pp. 155–168 (2003)

    Google Scholar 

  5. Béchet, D., Foret, A., Tellier, I.: Learnability of Pregroup Grammars. Studia Logica 87, 225–252 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bonato, R., Retoré, C.: Learning rigid Lambek grammars and minimalist grammars from structured sentences. In: Proceedings of Learning Language in Logic Workshop (LLL), pp. 23–34 (2001)

    Google Scholar 

  7. Buszkowki, W., Penn, G.: Categorial grammars determined from linguistic data by unification. Studia Logica, 431–454 (1990)

    Google Scholar 

  8. Dudau-Sofronie, D.: Apprentissage de grammaires catégorielles pour simuler l’acquisition du langage naturel à l’aide d’informations sémantiques, PhD thesis, Université de Lille (2004)

    Google Scholar 

  9. Dupont, F.: Apprentissage de grammaires de Lambek à partir de types. In: Mémoire DEA d’informatique de Lille1 (2003)

    Google Scholar 

  10. Dudau-Sofronie, D., Tellier, I., Tommasi, M.: From logic to grammars via types. In: Proceedings of Learning Language in Logic Workshop (LLL), pp. 35–46 (2001)

    Google Scholar 

  11. Dudau-Sofronie, D., Tellier, I., Tommasi, M.: A learnable class of Classical Categorial Grammars from typed examples. In: Proceedings of the 8th Conference on Formal Grammar, pp. 77–88 (2003)

    Google Scholar 

  12. Foret, A., Le Nir, Y.: On Limit Points for Some Variants of Rigid Lambek Grammars. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 106–119. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Fulop, S.: On the Logic and Learning of Language. Trafford Inc., Canada (2004)

    Google Scholar 

  14. Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  15. Houdé, O.: Rationnalité, développement et inhibition. Presses Universitaires de, France (1998)

    Google Scholar 

  16. Janssen, T.M.V.: Compositionality. In: Handbook of Logic and Language, pp. 417–473. MIT Press, Cambridge (1997)

    Google Scholar 

  17. Kanazawa, M.: Learnable Classes of Categorial Grammars. CSLI Publications, Stanford (1998)

    Google Scholar 

  18. Lambek, J.: The mathematics of sentence structure, vol. (65), pp. 154–170 (1958)

    Google Scholar 

  19. Montague, R.: Formal Philosophy; Selected papers of Richard Montague (1974)

    Google Scholar 

  20. Moortgat, M.: Categorial type logics. In: Handbook of Logic and Language. MIT Press, Cambridge (1997)

    Google Scholar 

  21. Oehrle, R.T., Bach, E., Wheeler, D.: Categorial grammars and natural language structures. Reidel, Dordrechtz (1988)

    Google Scholar 

  22. Partee, B.: Mathematical methods in Linguistics, vol. (30) (1990)

    Google Scholar 

  23. Pentus, M.: Lambek calculus is np-complete, Draft (2003)

    Google Scholar 

  24. Pinker, S.: Language Acquisition. In: An Invitation to Cognitive Science, pp. 135–182. MIT Press, Cambridge (2005)

    Google Scholar 

  25. Retoré, C.: The logic of categorial grammars. In: ACL 2001 and Rapport Inria 5703 (2003)

    Google Scholar 

  26. Tellier, I.: Modéliser l’acquisition de la syntaxe via l’hypothése de la primauté du sens, Habilitation thesis, university of Lille3 (2005)

    Google Scholar 

  27. Tellier, I.: How to Split Recursive Automata. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 200–212. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  28. van Benthem, J.: The Lambek Calculus. In: Categorial Grammars and Natural Language Structures, pp. 35–68. Reidel, Dordrecht (1988)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tellier, I., Dudau-Sofronie, D. (2011). Good Types Are Useful for Learning. In: Pogodalla, S., Quatrini, M., Retoré, C. (eds) Logic and Grammar. Lecture Notes in Computer Science(), vol 6700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21490-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21490-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21489-9

  • Online ISBN: 978-3-642-21490-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics