- author = "Andrea {De Lorenzo} and Eric Medvet and Alberto Bartoli",
- title = "Automatic string replace by examples",
- booktitle = "GECCO '13: Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference",
- year = "2013",
- editor = "Christian Blum and Enrique Alba and Anne Auger and Jaume Bacardit and Josh Bongard and Juergen Branke and Nicolas Bredeche and Dimo Brockhoff and Francisco Chicano and Alan Dorin and Rene Doursat and Aniko Ekart and Tobias Friedrich and Mario Giacobini and Mark Harman and Hitoshi Iba and Christian Igel and Thomas Jansen and Tim Kovacs and Taras Kowaliw and Manuel Lopez-Ibanez and Jose A. Lozano and Gabriel Luque and John McCall and Alberto Moraglio and Alison Motsinger-Reif and Frank Neumann and Gabriela Ochoa and Gustavo Olague and Yew-Soon Ong and Michael E. Palmer and Gisele Lobo Pappa and Konstantinos E. Parsopoulos and Thomas Schmickl and Stephen L. Smith and Christine Solnon and Thomas Stuetzle and El-Ghazali Talbi and Daniel Tauritz and Leonardo Vanneschi",
- isbn13 = "978-1-4503-1963-8",
- pages = "1253--1260",
- keywords = "genetic algorithms, genetic programming",
- month = "6-10 " # jul,
- organisation = "SIGEVO",
- address = "Amsterdam, The Netherlands",
-
DOI = "
doi:10.1145/2463372.2463532",
- publisher = "ACM",
- publisher_address = "New York, NY, USA",
-
abstract = "Search-and-replace is a text processing task which may
be largely automated with regular expressions: the user
must describe with a specific formal language the
regions to be modified (search pattern) and the
corresponding desired changes (replacement expression).
Writing and tuning the required expressions requires
high familiarity with the corresponding formalism and
is typically a lengthy, error-prone process.
In this paper we propose a tool based on Genetic Programming (GP) for generating automatically both the search pattern and the replacement expression based only on examples. The user merely provides examples of the input text along with the desired output text and does not need any knowledge about the regular expression formalism nor about GP. We are not aware of any similar proposal. We experimentally evaluated our proposal on 4 different search-and-replace tasks operating on real-world datasets and found good results, which suggests that the approach may indeed be practically viable.",
- notes = "Also known as \cite{2463532} GECCO-2013 A joint meeting of the twenty second international conference on genetic algorithms (ICGA-2013) and the eighteenth annual genetic programming conference (GP-2013)",
