Discovering phonotactic finite-state automata by genetic search

Authors:
Anja Belz
Affiliations:
University of Sussex, Brighton, UK
Venue:
ACL '98 Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 2
Year:
1998

Citing 2
Cited 1

Grammatical Inference: Introduction and Survey-Part I

IEEE Transactions on Pattern Analysis and Machine Intelligence - Special memorial issue for Professor King-Sun Fu
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

Finite-state reduplication in one-level prosodic morphology

NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a genetic algorithm based approach to the automatic discovery of finite-state automata (FSAs) from positive data. FSAs are commonly used in computational phonology, but-given the limited learnability of FSAs from arbitrary language subsets-are usually constructed manually. The approach presented here offers a practical automatic method that helps reduce the cost of manual FSA construction.