Skip to main content
SpringerLink
Log in

Efficiency of Pregroups and the French Noun Phrase

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

We study mathematical and algorithmic properties of Lambek's pregroups and illustrate them by the French noun phrase. An algorithm of complexity n3 to solve the reduction problem in an arbitrary free pregroup as well as recognition by a pregroup grammar is presented. This algorithm is then specified to run in linear time. A sufficient condition for a language fragment that makes the linear algorithm complete is given.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bargelli, D. and Lambek, J., 2001, “An algebraic approach to the French sentence structure,” pp. 95–109, in Logical Aspects of Computational Linguistics, P. de Groote, G. Morrill, and C. Retoré, eds., LNAI 2099, Springer, 2001.

  • Buszkowski, W., 2001, “Lambek Grammars based on pregroups,” in Logical Aspects of Computational Linguistics, P. de Groote, G. Morrill, and C. Retoré, eds., LNAI 2099, Springer, 2001.

  • Carlier, A., 2001, “La Résistance des articles du et des à l'interprétation générique,” in Le Syntagme Nominal Syntaxe et Sémantique, D. Amiot et al., ed., Artois Presses Université, 2001.

  • Casadio, C., 2001, “An algebraic analysis of clitic pronouns in Italian, in Logical Aspects of Computational Linguistics, P. de Groote et al., eds., Springer LNAI 2099, Berlin 2001.

  • Younger, D., 1967, “Recognition and parsing of context-free languages in Time n3,” Information and Control, 10(2).

  • Degeilh, S., 2004, Linear tagging of agreement in the French verb phrase, preprint, in Proceedings of Categorial Grammars 2004, Montpellier France, 7–11 June 2004.

  • Earley, J., 1970, “An efficient context-free parsing algorithm,” Communications of the AMC 13(2), 94–102.

    Article  Google Scholar 

  • Kleiber, G., 2001, “Indéfinis: Lecture existentielle et lecture partitive,” in G. Kleiber et al., ed., Typologie des groupes nominaux, Presses Universités Rennes.

  • Kislak, A., 2002, “Pregroups versus English and Polish Grammar,” in New Perspectives in Logic and Formal Linguistics, Bulzoni Editore, Bologna, pp. 129–154.

  • Lambek, J., 1958, “The mathematics of sentence structure,” American Mathematical Monthly 65, 154–170.

    Google Scholar 

  • Lambek, J., 1999, “Type Grammar revisited,” pp. 1–27, in Logical Aspects of Computational Linguistics, A. Lecomte et al., ed., Springer LNAI 1582, pp. 1–27.

  • Lambek, J., 2003, “A computational algebraic approach to English grammar,” preprint, McGill University, Montreal, 2003, to be published in SYNTAX.

  • Lambek, J. and Preller, A., 2001a, “An algebraic approach to the German noun phrase,” Linguistic Analysis 31, 3–4.

    Google Scholar 

  • Lambek, J. Preller, A., 2001b, “An algebraic approach to the German sentence,” Linguistic Analysis 31, 3–4.

    Google Scholar 

  • Grevisse, M. and Goosse, A., 2001 “Le bon usage, grammaire française, Duculot, 2001.

  • Logic and Foundations of Computation, in Workshop on Mathematical Linguistics, Fields Institute Summer School, University of Ottawa, 18–19 June 2003.

  • Bargelli, D. and Lambek, J., 2003, “An algebraic approach to Arabic sentence structure,” Fields Institute, Logic and Foundations of Computation, Workshop on Mathematical Linguistics, University of Ottawa, June 18–19, 2003.

  • Casadio, C. and Lambek, J., 2003, “An algebraic approach to Latin sentence structure,” Fields Institute, Logic and Foundations of Computation, Workshop on Mathematical Linguistics, University of Ottawa, June 18–19, 2003.

  • Cardinal, K., 2003, “An algebraic approach to Japanese sentence structure,” Fields Institute, Logic and Foundations of Computation, Workshop on Mathematical Linguistics, University of Ottawa, June 18–19, 2003.

  • Oehrle, R., 2004, “A parsing algorithm for pregroup grammars,” Preprint in Proceedings of Categorial Grammars 2004, Montpellier France, 7–11 June 2004.

  • Preller, A., 2004, “Pregroups and linear processing of coordinate structures,” Preprint, in Proceedings of Categorial Grammars 2004, Montpellier France, 7–11 June 2004.

Download references

Author information

Authors and Affiliations

  1. LIRMM/CNRS, Montpellier, France

    Sylvain Degeilh & Anne Preller

Authors
  1. Sylvain Degeilh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anne Preller
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sylvain Degeilh.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Degeilh, S., Preller, A. Efficiency of Pregroups and the French Noun Phrase. J Logic Lang Inf 14, 423–444 (2005). https://doi.org/10.1007/s10849-005-1242-2

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10849-005-1242-2

Keywords

Search

Navigation