Abstract
Computational approaches to learning aspects of language typically reduce the problem to learning syntax alone, or learning a lexicon alone. These simplifications have led to disconnected solutions and some unreasonable assumptions about inputs to their algorithms. In this paper, we present an approach that exploits a grammar learning algorithm to learn its own alphabet, or lexicon. We present empirical results and categorize the successes and types of errors lexical acquisition approaches encounter.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Armstrong, T., Oates, T.: Learning in the lexical-grammatical interface. In: FLAIRS Conference. AAAI Press, Menlo Park (2008)
Tomita, M.: Dynamic construction of finite automata from examples using hill climbing. In: Proceedings of the 4th Annual Cognitive Science Conference, pp. 105–108 (1982)
Dupont, P.: Regular grammatical inference from positive and negative samples by genetic search: the gig method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 236–245. Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armstrong, T., Oates, T. (2008). Which Came First, the Grammar or the Lexicon?. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88008-0
Online ISBN: 978-3-540-88009-7
eBook Packages: Computer ScienceComputer Science (R0)