Extended Pregroup Grammars Applied to Natural Languages

• Authors: Aleksandra Kiślak-Malinowska
• Languages of publication: EN

Abstracts

EN

Pregroups and pregroup grammars were introduced by Lambek in 1999 [14] as an algebraic tool for the syntactic analysis of natural lan- guages. The main focus in that paper was on certain extended pregroup grammars such as pregroups with modalities, product pregroup grammars and tupled pregroup grammars. Their applications to different syntactic structures of natural languages, mainly Polish, are explored/shown here.

Keywords

EN

Pregroups; pregroup grammars; product pregroup grammars; tuple pregroup grammars

• Publisher: Uniwersytet Mikołaja Kopernika (Nicolaus Copernicus University in Toruń)
• Journal: Logic and Logical Philosophy
• Year: 2012
• Volume: 21
• Issue: 3
• Pages: 229-252

Dates

published

2012-09-01

online

2013-07-02

Contributors

author

Aleksandra Kiślak-Malinowska

• Faculty of Mathematics and Computer Science University of Warmia and Mazury Olsztyn, Poland

References

• [1] Buszkowski,W., “Lambek grammars based on pregroups”, Logical Aspectsof Computational Linguistics, LNAI 2099, Springer, 2001, 95-109.
• [2] Buszkowski, W., “Sequent systems for compact bilinear logic”, Mathemat-ical Logic Quarterly 49, 5 (2003): 467-474.
• [3] Buszkowski, W., and K. Moroz, “Pregroup grammars and context-free grammars”, pages 1-22 in: Computational Algebraic Approaches to Natu-ral Language, Polimetrica, 2008.
• [4] Casadio, C., and J. Lambek, “An algebraic analysis of clitic pronouns in Italian”, pages 110-124 in: Logical Aspects of Computational Linguistics, LNAI 2099, Springer, 2001.
• [5] Casadio, C., “Applying pregroups to Italian statements and questions”, Studia Logica 87 (2007).
• [6] Casadio, C., “Agreement and cliticization in Italian: A pregroup analy- sis”, pages 166-177 in: Lecture Notes in Computer Science, LNCS 6031, Springer, 2010.
• [7] Fadda, M., “Toward flexible pregroup grammars”, pages 95-112 in: NewPerspectives in Logic and Formal Linguistics, Bulzoni Editore, Roma, 2002.
• [8] Kiślak, A., “Pregroups versus English and Polish grammar”, pages 129-154 in: New Perspectives in Logic and Formal Linguistics, Bulzoni Edi- tore, Roma, 2002.
• [9] Kiślak-Malinowska, A., “On the Logic of β-pregroups”, Studia Logica 87 (2007): 321-340.
• [10] Kiślak-Malinowska, A., “Polish language in terms of pregroups”, pages 145-172 in: Computational Algebraic Approaches to Natural Language, Polimetrica, 2008.
• [11] Kiślak-Malinowska, A., “Some aspects of Polish grammar in terms of tu- pled pregroups”, Linguistic Analysis (2010): 93-119.
• [12] Kusalik, T., “Product pregroups as an alternative to inflectors”, pages 173-190 in: Computational Algebraic Approaches to Natural Language, Polimetrica, 2008.
• [13] Lambek, J., “The mathematics of sentence structure”, The AmericanMathematical Monthly 65 (1958): 154-170.
• [14] Lambek, J., “Type grammars revisited”, pages 1-27 in: Logical Aspectsof Computational Linguistics, A. Lecomte, F. Lamarche and G. Perrier (eds.), LNAI 1582, Springer, Berlin, 1999.
• [15] Lambek, J., “Type grammars as pregroups”, Grammars 4 (2001): 21-39.
• [16] Lambek, J., “Pregroups: a new algebraic approach to sentence structure”, pages 39-54 in: New Perspectives in Logic and Formal Linguistics, Bulzoni Editore, Roma, 2002.
• [17] Lambek, J., From word to sentence, Polimetrica, 2008.
• [18] Lambek, J., “Exploring feature agreement in French with parallel pre- group computations”, Journal of Logic, Language and Information (2009).
• [19] Moroz, K., “Algorithmic questions for pregroup grammrs”, PhD Thesis, Poznań 2010.
• [20] Stabler, E., “Tupled pregroup grammars”, pages 23-52 in: ComputationalAlgebraic Approaches to Natural Language, Polimetrica, 2008.

Identifiers

DOI

10.12775/LLP.2012.012