Abstract
The present paper is a short reflection concerning the role which inductive inference played and can play in language learning. We shortly recall some major insights obtained and outline some new directions based on own work and results recently presented in the literature.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Adriaans, P.W., Trautwein, M., Vervoort, M.: Towards high speed grammar induction on large text corpora. In: Jeffery, K., Hlaváč, V., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol. 1963, pp. 173–186. Springer, Heidelberg (2000)
Angluin, D.: Finding patterns common to a set of strings. J. of Comput. Syst. Sci. 21(1), 46–62 (1980)
Angluin, D.: Inductive inference of formal languages from positive data. Inform. Control 45(2), 117–135 (1980)
Clark, A., Eyraud, R.: Identification in the limit of substitutable contextfree languages. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol. 3734, pp. 283–296. Springer, Heidelberg (2005)
de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27, 125–138 (1997)
Freivalds, R., Kinber, E.B., Wiehagen, R.: On the power of inductive inference from good examples. Theoret. Comput. Sci. 110(1), 131–144 (1993)
Gold, E.M.: Language identification in the limit. Inform. Control 10(5), 447–474 (1967)
Rogers, J.H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Hopcroft, J., Ullman, J.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)
Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems that Learn: An Introduction to Learning Theory, 2nd edn. MIT Press, Cambridge (1999)
Joachims, T.: Learning to Classify Text using Support Vector Machines: Methods, Theory, and Algorithms. Kluwer Academic Publishers, Dordrecht (2002)
Lange, S., Nessel, J., Wiehagen, R.: Learning recursive languages from good examples. Annals of Mathematics and Artificial Intelligence 23(1/2), 27–52 (1998)
Lange, S., Wiehagen, R.: Polynomial-time inference of arbitrary pattern languages. New Generation Computing 8(4), 361–370 (1991)
Osherson, D.N., Stob, M., Weinstein, S.: Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge (1986)
Reischuk, R., Zeugmann, T.: An average-case optimal one-variable pattern language learner. J. Comput. Syst. Sci. 60(2), 302–335 (2000)
Rossmanith, P., Zeugmann, T.: Stochastic finite learning of the pattern languages. Machine Learning 44(1/2), 67–91 (2001)
Shinohara, T.: Rich classes inferable from positive data: Length-bounded elementary formal systems. Inform. Comput. 108(2), 175–186 (1994)
Shinohara, T., Arikawa, S.: Pattern inference. In: Algorithmic Learning for Knowledge-Based Systems. LNCS (LNAI), vol. 961, pp. 259–291. Springer, Heidelberg (1995)
Wiehagen, R., Zeugmann, T.: Learning and consistency. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS (LNAI), vol. 961, pp. 1–24. Springer, Heidelberg (1995)
Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoret. Comput. Sci. 298(1), 179–206 (2003)
Zeugmann, T.: Lange and Wiehagen’s pattern language learning algorithm: An average-case analysis with respect to its total learning time. Annals of Mathematics and Artificial Intelligence 23, 117–145 (1998)
Zeugmann, T., Lange, S.: A guided tour across the boundaries of learning recursive languages. In: Algorithmic Learning for Knowledge-Based Systems. LNCS (LNAI), vol. 961, pp. 190–258. Springer, Heidelberg (1995)
Zeugmann, T., Lange, S., Kapur, S.: Characterizations of monotonic and dual monotonic language learning. Inform. Comput. 120(2), 155–173 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zeugmann, T. (2006). Inductive Inference and Language Learning. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_44
Download citation
DOI: https://doi.org/10.1007/11750321_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)