Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On Harmonic CCG and Pregroup Grammars

  • Conference paper
Logical Aspects of Computational Linguistics (LACL 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8535))

  • 587 Accesses

Abstract

This paper studies mappings between CCG and pregroup grammars, to allow a transfer of linguistic resources from one formalism to the other. We focus on mappings that preserve the binary structures, we also discuss some possible alternatives in the underlying formalisms, with some experiments.

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

Access this chapter

Log in via an institution
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. Baldridge, J., Hoyt, F.: Categorial grammar. To appear in Kiss, T., Alexiadou, A. (eds.) Handbook of Syntax. de Gruyter, Berlin (2014)

    Google Scholar 

  2. Béchet, D.: Parsing pregroup grammars and Lambek calculus using partial composition. Studia Logica 87(2-3), 199–224 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Béchet, D., Dikovsky, A.J., Foret, A., Garel, E.: Optional and iterated types for pregroup grammars. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 88–100. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Béchet, D., Foret, A.: A pregroup toolbox for parsing and building grammars of natural languages. Linguistic Analysis Journal 36 (2010)

    Google Scholar 

  5. Buszkowski, W.: Lambek grammars based on pregroups. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 95–109. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Clark, S., Curran, J.R.: Wide-coverage efficient statistical parsing with ccg and log-linear models. Computational Linguistics 33(4), 493–552 (2007)

    Article  MATH  Google Scholar 

  7. Foret, A.: A modular and parameterized presentation of pregroup calculus. Inf. Comput. 208(5), 510–520 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fowler, T.: Parsing CCGbank with the Lambek calculus. In: Proc. Parsing with Categorial Grammars, ESSLLI Workshop, in Bordeaux, France (2009)

    Google Scholar 

  9. Francez, N., Kaminski, M.: Commutation-augmented pregroup grammars and mildly context-sensitive languages. Studia Logica 87(2-3), 295–321 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  10. Jäger, G.: Lambek grammars as combinatory categorial grammars. Logic Journal of the IGPL 9(6), 781–792 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Joshi, A., Vijay-Shanker, K., Weir, D.: The convergence of mildly context-sensitive grammar formalisms. In: Wasow, T., Sells, P. (eds.) The Processing of Linguistic Structure, pp. 31–81. MIT Press (1991)

    Google Scholar 

  12. Kislak-Malinowska, A.: On the logic of beta -pregroups. Studia Logica 87(2-3), 323–342 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kruijff, G.J.M., Baldridge, J.: Multi-modal combinatory categorial grammar. In: EACL, pp. 211–218. The Association for Computer Linguistics (2003)

    Google Scholar 

  14. Kuhlmann, M., Koller, A., Satta, G.: The importance of rule restrictions in ccg. In: Hajic, J., Carberry, S., Clark, S. (eds.) ACL, pp. 534–543. The Association for Computer Linguistics (2010)

    Google Scholar 

  15. Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly 65 (1958)

    Google Scholar 

  16. Lambek, J.: Type grammar revisited. In: Lecomte, A., Perrier, G., Lamarche, F. (eds.) LACL 1997. LNCS (LNAI), vol. 1582, pp. 1–27. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. Stabler, E.: Tupled pregroup grammars. Polimetrica Computational Algebraic Approaches to Morphology and Syntax (2-3), 23–52 (2004)

    Google Scholar 

  18. Steedman, M.: The Syntactic Process. MIT Press, Cambridge (2000)

    Google Scholar 

  19. Steedman, M.: Taking Scope - The Natural Semantics of Quantifiers. MIT Press (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, University of Rennes 1, Campus de Beaulieu, 35042, Rennes cedex, France

    Annie Foret

Authors
  1. Annie Foret
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRIT, 118 route de Narbonne, 31062, Toulouse, France

    Nicholas Asher  & Sergei Soloviev  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Foret, A. (2014). On Harmonic CCG and Pregroup Grammars. In: Asher, N., Soloviev, S. (eds) Logical Aspects of Computational Linguistics. LACL 2014. Lecture Notes in Computer Science, vol 8535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43742-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43742-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43741-4

  • Online ISBN: 978-3-662-43742-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation