Abstract
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of evolving general finite state machines, there has been much less work on evolving FSTs. In particular, the fitness functions required for evolving FSTs are generally different to those used for FSMs. This paper considers three string-distance based fitness functions. We compute their fitness distance correlations, and present results on using two of these (Strict and Hamming) to evolve FSTs. We can control the difficulty of the problem by the presence of short strings in the training set, which make the learning problem easier. In the case of the harder problem, the Hamming measure performs best, while the Strict measure performs best on the easier problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L.J. Fogel, A.J. Owens, and M.J. Walsh. Artificial intelligence through a simulation of evolution. In M. Maxfield, A. Callahan, and L.J. Fogel, editors, Biophysics and Cybernetic Systems: Proceedings of the 2nd Cybernetic Sciences Symposium, pages 131–155. Spartan Books, Washington DC, (1965).
Kumar Chellapilla and David Czarnecki. A preliminary investigation into evolving modular finite state machines. In Proceedings of Congress on Evolutionary Computation, pages 1349–1356. (1999).
D. Jefferson, R. Collins, C. Cooper, M. Dyer, M. Flowers, R. Korf, C. Taylor, and A. Wang. Evolution as a theme in artificial life: The genesys/tracker system. Proceedings of Artificial Life II, (1991).
Karl Benson. Evolving automatic target detection algorithms that logically combine decision spaces. Proceedings of the British Machine Vision Conference, pages 685–694, (2000).
P. Wyard. Context-free grammar induction using genetic algorithms. In R.K. Belew and L.B. Booker, editors, Proceedings of the fourth international conference on Genetic Algorithms, pages 514–518. Morgan Kaufman, San Mateo, CA, (1991).
S.M. Lucas. Structuring chromosomes for context-free grammar evolution. In Proceedings of IEEE International Conference on Evolutionary Computation, pages 130–135. IEEE, Orlando, (1994).
M. Lankhorst. A genetic algorithm for induction of nondeterministic pushdown automata. University of Groningen, Computer Science Report CS-R 9502, (1995).
J. Oncina. The data driven approach applied to the OSTIA algorithm. Lecture Notes in Computer Science, 1433:50–--, 1998.
Daniel Gildea and Daniel Jurafsky. Automatic induction of finite state transducers for simple phonological rules. In Meeting of the Association for Computational Linguistics, pages 9–15, 1995.
J. Oncina, P. Garcia, and E. Vidal. Learning subsequential transducers for pattern recognition interpretation tasks. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13:252–264, (1991).
H. Freeman. Computer processing of line-drawing images. Computing Surveys, 6:57–97, 1974.
H. Bunke and U. Buhler. Applications of approximate string matching to 2d shape recognition. Pattern Recognition, 26:1797–1812, (1993).
S.M. Lucas and A. Amiri. Statistical syntactic methods for high performance ocr. IEE Proceedings on Vision, Image and Signal Processing, 143:23–30, (1996).
R.A. Mollineda, E. Vidal, and F. Casacuberta. A windowed weighted approach for approximate cyclic string matching. International Conference on Pattern Recognition, pages 188–191, (2002).
D. Jurafsky and J.H. Martin. Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics and Speech Recognition. Prentice Hall.
T. Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, PhD Dissertaion, The University of New Mexico, 1995.
B. Naudts and L. Kallel. A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 4:1–15, (2000).
Julian F. Miller and Peter Thomson. Cartesian genetic programming. In Riccardo Poli, Wolfgang Banzhaf, William B. Langdon, Julian F. Miller, Peter Nordin, and Terence C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP’2000, volume 1802 of LNCS, pages 121–132, Edinburgh, 15–16 April 2000. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lucas, S.M. (2003). Evolving Finite State Transducers: Some Initial Explorations. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-36599-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00971-9
Online ISBN: 978-3-540-36599-0
eBook Packages: Springer Book Archive