Abstract
This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first theoretical approach, we provide learnability and non-learnability results in the sense of Gold for subclasses of Pregroup Grammars. In a second more practical approach, we propose an acquisition algorithm from a special kind of input called Feature-tagged Examples, that is based on sets of constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lambek, J.: Type grammars revisited. In: Lecomte, A., Perrier, G., Lamarche, F. (eds.) LACL 1997. LNCS (LNAI), vol. 1582, p. 1. Springer, Heidelberg (1999)
Bargelli, D., Lambek, J.: An algebraic approach to french sentence structure. In: [17]
Casadio, C., Lambek, J.: An algebraic analysis of clitic pronouns in italian. In: [17]
Kanazawa, M.: Learnable classes of categorial grammars. Studies in Logic, Language and Information. In: FoLLI & CSLI, Cambridge University Press, Cambridge (1998)
Gold, E.: Language identification in the limit. Information and control 10, 447–474 (1967)
Béchet, D., Foret, A.: Remarques et perspectives sur les langages de prégroupe d’ordre 1/2. In: Atala (ed.) Actes de la conférence internationale Traitement Automatique des Langues Naturelles, TALN 2003 (2003) (poster in French)
Dudau-Sofronie, D., Tellier, I., Tommasi, M.: Learning categorial grammars from semantic types. In: Proccedings of the 13rd Amsterdam Colloquium., pp. 79–84 (2001)
Dudau-Sofronie, D., Tellier, I., Tommasi, M.: A learnable class of ccg from typed examples. In: Proccedings of the 8th conference on Formal Grammar (FGVienna), pp. 77–88 (2003)
Dudau-Sofronie, D., Tellier, I.: A study of learnability of lambek grammars from typed examples. In: Categorial Grammars 2004, pp. 133–147 (2004)
Lambek, J.: Mathematics and the mind. In: Abrusci, V., Casadio, C. (eds.) New Perspectives in Logic and Formal Linguisitics, Proceedings Vth ROMA Workshop, Bulzoni Editore (2001)
Foret, A.: Some unlearnability results for lambek categorial and pregroup grammars (oral communication). In: ESSLII, Trento, Italy (2002)
Foret, A., Le Nir, Y.: Lambek rigid grammars are not learnable from strings. In: COLING 2002, 19th International Conference on Computational Linguistics, Taipei, Taiwan (2002)
Buszkowski, W.: Mathematical linguistics and proof theory.In: [18] , ch.12 , pp.683– 736
Moortgat, M.: Categorial type logic.In: [18] ch. 2,pp. 93–177
Buszkowski, W.: Lambek grammars based on pregroups. In:[17]
Nicolas, J.: Grammatical inference as unification. Technical Report 3632, IRISA, Unité de Recherche INRIA Rennes (1999)
de Groote, P., Morill, G., Retoré, C. (eds.): LACL 2001. LNCS (LNAI), vol. 2099. Springer, Heidelberg (2001)
van Benthem, J., ter Meulen, A. (eds.): Handbook of Logic and Language. North- Holland Elsevier, Amsterdam (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béchet, D., Foret, A., Tellier, I. (2004). Learnability of Pregroup Grammars. In: Paliouras, G., Sakakibara, Y. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2004. Lecture Notes in Computer Science(), vol 3264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30195-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30195-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23410-4
Online ISBN: 978-3-540-30195-0
eBook Packages: Springer Book Archive