Abstract
Pregroup grammars are a context-free grammar formalism which may be used to describe the syntax of natural languages. However, this formalism is not able to naturally define types corresponding to optional and iterated arguments such as optional complements of verbs or verbs’ adverbial modifiers. This paper introduces two constructions that make up for this deficiency.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lambek, J.: Type grammars revisited. In: Lecomte, A., Lamarche, F., Perrier, G. (eds.) LACL 1997. LNCS (LNAI), vol. 1582. Springer, Heidelberg (1999)
Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly 65, 154–170 (1958)
Casadio, C., Lambek, J.: An algebraic analysis of clitic pronouns in italian. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099. Springer, Heidelberg (2001)
Bargelli, D., Lambek, J.: An algebraic approach to french sentence structure. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099. Springer, Heidelberg (2001)
Lambek, J.: Type grammar meets german word order. Theoretical Linguistics 26, 19–30 (2000)
Lambek, J., Preller, A.: An algebraic approach to the german noun phrase. Linguistic Analysis 31, 3–4 (2003)
Cardinal, K.: An algebraic study of Japanese grammar. Master’s thesis, McGill University, Montreal (2002)
Sadrzadeh, M.: Pregroup analysis of persian sentences (2007)
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)
Tesnière, L.: Éléments de syntaxe structurale. Librairie C. Klincksiek, Paris (1959)
Hays, D.: Dependency theory: A formalism and some observations. Language 40, 511–525 (1964)
Sleator, D.D., Temperly, D.: Parsing English with a Link Grammar. In: Proc. IWPT 1993, pp. 277–291 (1993)
Kahane, S. (ed.): Les grammaires de dépendance, Paris, Hermes. Traitement automatique des langues, vol. 41(1) (2000)
Dikovsky, A.: Dependencies as categories. In: Kruiff, G.J., Duchier, D. (eds.) Proc. of Workshop Recent Advances in Dependency Grammars, In conjunction with COLING 2004, Geneva, Switzerland, August, 28th 2004, pp. 90–97 (2004)
Dekhtyar, M., Dikovsky, A.: Categorial dependency grammars. In: Moortgat, M., Prince, V. (eds.) Proc. of Int. Conf. on Categorial Grammars, Montpellier (2004)
Béchet, D., Dikovsky, A., Foret, A., Garel, E.: Introduction of option and iteration into pregroup grammars. In: Casadio, C., Lambek, J. (eds.) Computational Algebric Approaches to Morphology and Syntax, Polimetrica, Monza (Milan), Italy (2008)
Dos̆en, K.: Cut Elimination in Categories. Kluwer Academic publishers, Dordrecht (1999)
Buszkowski, W.: Cut elimination for the lambek calculus of adjoints. In: Abrusci, V., Casadio, C. (eds.) New Perspectives in Logic and Formal Linguisitics, Proceedings Vth ROMA Workshop, Bulzoni Editore (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béchet, D., Dikovsky, A., Foret, A., Garel, E. (2008). Optional and Iterated Types for Pregroup Grammars. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-88282-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88281-7
Online ISBN: 978-3-540-88282-4
eBook Packages: Computer ScienceComputer Science (R0)