Ahmet Cetinkaya
ABSTRACT
This study investigates automatic regular expression generation using Grammatical Evolution. The software implementation is based on a subset of POSIX regular expression rules. For fitness calculation, a multiline text file is supplied. Lines which are required to match with generated regular expressions are specified beforehand. Fitness is evaluated according to the successful match results. Using this fitness evaluation strategy, preliminary tests have been performed on different files. Results indicate that the Grammatical Evolution approach to automatic generation of regular expressions is promising.
- A. E. Eiben and J. E. Smith. Introduction to Evolutionary Computing. Springer, 2003. Google Scholar
Digital Library
- J. E. Friedlt. Mastering Regular Expressions. Addison-Wesley Publishing Company, Sebastopol, CA, 1997. Google ScholarDigital Library
- A. Heddad, M. Brameier, and R. M. MacCallum. Evolving regular expression-based sequence classifiers for protein nuclear localisation. In G. R. Raidl, S. Cagnoni, J. Branke, D. W. Corne, R. Drechsler, Y. Jin, C. R. Johnson, P. Machado, E. Marchiori, F. Rothlauf, G. D. Smith, and G. Squillero, editors, Applications of Evolutionary Computing, EvoWorkshops 2004, volume 3005 of LNCS, pages 31--40, Coimbra, Portugal, 5-7 Apr. 2004. Springer Verlag.Google Scholar
- P. Linz. An Introduction to Formal Languages and Automata. John and Barlett Publishers, Sudbury, Massachusetts, 2000. Google ScholarDigital Library
- M. O'Neill and C. Ryan. Under the hood of grammatical evolution. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1143--1148, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.Google Scholar
- M. O'Neill and C. Ryan. Grammatical evolution. IEEE Transactions on Evolutionary Computation, 5(4):349--358, Aug. 2001. Google ScholarDigital Library
- M. O'Neill and C. Ryan. Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language. Kluwer Academic Publishers Group, Norwell, Massachusetts, 2003. Google ScholarDigital Library
- C. Ryan, J. J. Collins, and M. O Neill. Grammatical evolution: Evolving programs for an arbitrary language. In W. Banzhaf, R. Poli, M. Schoenauer, and T. C. Fogarty, editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391, pages 83--95, Paris, 14-15 1998. Springer-Verlag. Google ScholarDigital Library
- Regular expression generation through grammatical evolution
Recommendations
Computation of regular expression derivatives
The conversion of regular expressions into finite state automata and finite state automata into regular expression is an important area of research in automata theory. The notion of derivatives of regular expressions has been introduced to make the ...
Construction of fuzzy automata from fuzzy regular expressions
Li and Pedrycz have proved fundamental results that provide different equivalent ways to represent fuzzy languages with membership values in a lattice-ordered monoid, and generalize the well-known results of the classical theory of formal languages. In ...
Probabilistic Grammatical Evolution
Genetic ProgrammingAbstractGrammatical Evolution (GE) is one of the most popular Genetic Programming (GP) variants, and it has been used with success in several problem domains. Since the original proposal, many enhancements have been proposed to GE in order to address some ...
Comments