Abstract
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken into account, which seems cognitively relevant for the modeling of natural language learning. The syntactic formalism used is the one of Lambek categorial grammars and meaning is represented with logical formulas. The principle of compositionality is admitted and defined as an isomorphism applying to trees and allowing to automatically translate sentences into their semantic representation(s). Simple simulations of a learning algorithm are extensively developed and discussed.
This research was partially supported by “Motricité et cognition”: contrat par objectifs de la région Nord/Pas de Calais and basic ideas of this paper were presented at the Workshop on Paradigms and Grounding in Language Learning of the conference Computational Natural Language Leaning 98.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. W. Adriaans, Language Learning from a Categorial Perspective, Ph.D. thesis, University of Amsterdam, 1992.
J. R. Anderson, “Induction of Augmented Transition Networks”, Cognitive Science 1, p125–157, 1977.
W. Buszkowski, G. Penn, “Categorial grammars determined from linguistic data by unification”, Studia Logica 49, p431–454, 1990.
N. Chomsky, Aspects of the Theory of Syntax, Cambridge, MIT Press.
N. Chomsky, Language and Mind, Brace & World, 1968.
F. Denis, R. Gilleron, “PAC learning under helpful distributions”, Proceedings of the 8th ACM Workshop on Computational Learning Theory, p132–145, 1997.
D. R. Dowty, R. E. Wall, S. Peters, Introduction to Montague Semantics, Reidel, Dordrecht, 1989.
A. Finkel, I. Tellier: “A polynomial algorithm for the membership problem with categorial grammars”, Theoretical Computer Science 164, p207–221, 1996.
E. M. Gold, “Language Identification in the Limit”, Information and Control 10, P447–474, 1967.
H. Hamburger, K. Wexler, “A mathematical Theory of Learning Transformational Grammar”, Journal of Mathematical Psychology 12, p137–177, 1975.
J. C. Hill, “A computational model of language acquisition in the two-year-old”, Cognition and Brain Theory 6(3), p287–317, 1983.
M. Kanazawa, “Identification in the Limit of Categorial Grammars”, Journal of Logic, Language & Information, vol 5, nℴ2, p115–155, 1996.
J. Lambek, “The mathematics of Sentence Structure”, American Mathematical Monthly, nℴ65, p154–170, 1958.
P. Langley, “Language acquisition through error discovery”, Cognition and Brain Theory 5, p211–255, 1982.
M. Li, P. Vitanyi, “A theory of learning simple concepts under simple distributions”, SIAM J. Computing, 20(5), p915–935, 1991.
R. Montague, Formal Philosophy; Selected papers of Richard Montague, Yale University Press, New Haven, 1974.
M. Moortgat, Categorial investigations, logical and linguistic aspects of the Lambek Calculus, Foris, Dordrecht, 1988.
R. T. Oehrle, E. Bach, D. Wheeler (eds.), Categorial Grammars and Natural Language Structure, Reidel, Dordrecht, 1988.
M. Pentus, “Lambek grammars are context-free”, in: 8th Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, p429–433, 1992.
S. Pinker, “Formal models of language learning”, Cognition 7, p217–283, 1979.
Y. Sakakibara, “Efficient learning of context-free grammars from positive structural examples”, Information & Computation 97, p23–60, 1992.
S. Schieber, “Evidence against the context-freeness of natural languages”, Linguistics and Philosophy 8, p333–343, 1995.
T. Shinohara, “Inductive inference of monotonic formal systems from positive data”, p339–351 in: Algorithmic Learning Theory, S. Arikara, S. Goto, S. Ohsuga & T. Yokomori (eds), Tokyo: Ohmsha and New York and Berlin: Springer.
L. G. Valiant, “A theory of the learnable”, Communication of the ACM, p1134–1142, 1984.
K. Wexler, P. Culicover, Formal Principles of Language Acquisition, Cambridge, MIT Press.
W. Zielonka, “Axiomatizability of Ajdukiewicz-Lambek calculus by means of cancellations schemes”, Zeischrift für Mathematsche Logik und grunlagen der Mathematik 27, p215–224, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tellier, I. (1998). Meaning helps learning syntax. In: Honavar, V., Slutzki, G. (eds) Grammatical Inference. ICGI 1998. Lecture Notes in Computer Science, vol 1433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054061
Download citation
DOI: https://doi.org/10.1007/BFb0054061
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64776-8
Online ISBN: 978-3-540-68707-8
eBook Packages: Springer Book Archive