Skip to main content
SpringerLink
Log in

A genetic algorithm for grammatical inference

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 796))

Included in the following conference series:

Abstract

In this paper, genetic algorithms have been shown to be a useful tool for the induction of context-free grammars from positive and negative examples of a language. Grammars for the language of correct parentheses expressions, for the language of equal numbers of a's and b's, for several regular languages, and for a small natural language subset have been inferred more or less correctly. Further experimentation will have to show whether this technique is applicable to more complex languages.

Most of the computations were carried out on the Connection Machine CM-5 of the University of Groningen, the investments in which were partly supported by the Netherlands Computer Science Research Foundation (SION) and the Netherlands Organization for Scientific Research (NWO).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. K.S. Fu and T.L. Booth. Grammatical inference: Introduction and survey. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8:343–375, 1986.

    Google Scholar 

  2. J.H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975.

    Google Scholar 

  3. S. Sen and J. Janakiraman. Learning to construct pushdown automata for accepting deterministic context-free languages. In G. Biswas, editor, SPIE Vol. 1707: Applications of Artificial Intelligence X: Knowledge-Based Systems, pages 207–213. 1992.

    Google Scholar 

  4. P. Wyard. Context free grammar induction using genetic algorithms. In R.Belew and L.B.Booker, editors, Proceedings of the Fourth Conference on Genetic Algorithms ICGA'92. Morgan Kaufmann, 1992.

    Google Scholar 

  5. H. Zhou and J.J. Grefenstette. Induction of finite automata by genetic algorithms. In Proceedings of the 1986 IEEE International Conference on Systems, Man and Cybernetics, pages 170–174, Atlanta, GA, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing Science, University of Groningen, P.O.Box 800, 9700, AV Groningen, The Netherlands

    Marc M. Lankhorst

Authors
  1. Marc M. Lankhorst
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Gentzsch Uwe Harms

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lankhorst, M.M. (1994). A genetic algorithm for grammatical inference. In: Gentzsch, W., Harms, U. (eds) High-Performance Computing and Networking. HPCN-Europe 1994. Lecture Notes in Computer Science, vol 796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020409

Download citation

  • DOI: https://doi.org/10.1007/BFb0020409

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57980-9

  • Online ISBN: 978-3-540-48406-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation