Abstract
This paper describes results on the inference of two classes of context free grammar (CFG), using a genetic algorithm (GA). The first class is that of n-symbol palindromes, where n=2 to 4; the second class is small natural language grammars. The use of different normal forms of the grammars was compared experimentally. The use of different encodings of the grammars in the chromosomes of the GA, and the implications of these different representations within the genetic search are discussed. It is concluded that by paying attention to representational issues, worthwhile results may be achieved using a GA.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Fu, K, and Booth, T, Grammatical Inference: Introduction and Survey, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 8, pp. 343–375, 1986.
Gold, E.M., Complexity of automaton identification from given data, Information and Control, 37, 302–320.
Angluin, D., and Smith, C.H., “Inductive inference: theory and methods”. Computing Surveys, vol. 15, no.3, September 1983.
Cohen, P.R., and Feigenbaum, E.A., “The handbook of artificial intelligence: volume 2”. Los Altos, California. Publ Morgan Kaufmann, 1983.
Lucas,S, New Directions in Grammatical Inference, Proc. IEE Colloq. on Grammatical Inference: Theory, Applications and Alternatives, 1993, Digest No. 1993/092, London.
Holland, J.H. “Adaptation in natural and artificial systems”, Univ. of Michigan Press, Ann Arbor, 1975.
Goldberg, D., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
Lucas, S, Biased Chromosomes for Grammatical Inference, Proc. of Natural Algorithms in Signal Processing, IEE Workshop at Danbury Park, UK, 1993.
Lucas,S, Structuring Chromosomes for Context-Free Grammar Evolution, First International Conference on Evolutionary Computing, pp. 130–135, 1994.
Kitano, H, Designing neural networks using genetic algorithm with graph generation system, Complex Systems, vol. 4, pp. 461–476, 1990.
Gruau, F, Cellular Encoding as a Graph Grammar, Proc. IEE Colloq. on Grammatical Inference: Theory, Applications and Alternatives, 1993, Digest No. 1993/092, London.
Koza, J, Genetic Programming, MIT Press, 1992.
Wyard, P J, Context Free Grammar Induction Using Genetic Algorithms, Proc. IEE Colloq. on Grammatical Inference: Theory, Applications and Alternatives, 1993, Digest No. 1993/092, London.
Giordano, J-Y, Version Space for Learning Context-Free Grammars, Proc. IEE Colloq. on Grammatical Inference: Theory, Applications and Alternatives, 1993, Digest No. 1993/092, London.
Lari, K. and Young, S.J., The estimation of stochastic context-free grammars using the Inside-Outside algorithm, Computer Speech and Language, vol. 4, no. 1, 1990.
Hopcroft, J. and Ullman, J, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.
Dunay,D, Petry, F, and Buckles, B, Regular Language Induction with Genetic Programming, First International Conference on Evolutionary Computing, pp. 396–400, 1994.
Goldberg, D, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wyard, P. (1994). Representational issues for context free grammar induction using genetic algorithms. In: Carrasco, R.C., Oncina, J. (eds) Grammatical Inference and Applications. ICGI 1994. Lecture Notes in Computer Science, vol 862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58473-0_151
Download citation
DOI: https://doi.org/10.1007/3-540-58473-0_151
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58473-5
Online ISBN: 978-3-540-48985-6
eBook Packages: Springer Book Archive