Incremental construction of minimal acyclic sequential transducers from unsorted data

Authors:
Wojciech Skut
Affiliations:
Rhetorical Systems Ltd, Edinburgh, Scotland
Venue:
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Year:
2004

Citing 4
Cited 1

Minimization of Sequential Transducers

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Incremental construction of minimal acyclic finite-state automata

Computational Linguistics - Special issue on finite-state methods in NLP
Finite-state transducers in language and speech processing

Computational Linguistics
Simpler and more general minimization for weighted finite-state automata

NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1

Indexing methods for approximate dictionary searching: Comparative analysis

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) for a dictionary consisting of a list of input and output strings. The algorithm generalises a known method of constructing minimal finite-state automata (Daciuk et al., 2000). Unlike the algorithm published by Mihov and Maurel (2001), it does not require the input strings to be sorted. The new method is illustrated by an application to pronunciation dictionaries.