Regular expression generation through grammatical
evolution
A. Cetinkaya. Genetic and Evolutionary Computation Conference
(GECCO2007) workshop program, page 2643--2646. London, United Kingdom, ACM Press, (7-11 July 2007)
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.
%0 Conference Paper
%1 1274089
%A Cetinkaya, Ahmet
%B Genetic and Evolutionary Computation Conference
(GECCO2007) workshop program
%C London, United Kingdom
%D 2007
%E Yu, Tina
%I ACM Press
%K algorithms, evolution, expressions genetic grammatical programming, regular
%P 2643--2646
%T Regular expression generation through grammatical
evolution
%U http://doi.acm.org/10.1145/1274000.1274089
%X 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.
@inproceedings{1274089,
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.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {London, United Kingdom},
author = {Cetinkaya, Ahmet},
biburl = {https://www.bibsonomy.org/bibtex/296552531bfa767fa72ce57f39e3d385d/brazovayeye},
booktitle = {Genetic and Evolutionary Computation Conference
{(GECCO2007)} workshop program},
editor = {Yu, Tina},
interhash = {e33e1c4bf3dd10de47f1c9398e7418d2},
intrahash = {96552531bfa767fa72ce57f39e3d385d},
isbn13 = {978-1-59593-698-1},
keywords = {algorithms, evolution, expressions genetic grammatical programming, regular},
month = {7-11 July},
notes = {Distributed on CD-ROM at GECCO-2007 ACM Order No.
910071
Haskell, match HTML anchor tags in one file (266
lines), subset of POSIX, Pop=100.},
pages = {2643--2646},
publisher = {ACM Press},
publisher_address = {New York, NY, USA},
timestamp = {2008-06-19T17:37:27.000+0200},
title = {Regular expression generation through grammatical
evolution},
url = {http://doi.acm.org/10.1145/1274000.1274089},
year = 2007
}