Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data
计算与语言
2007-05-23 v1 数据结构与算法
摘要
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.
引用
@article{arxiv.cs/0408026,
title = {Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data},
author = {Wojciech Skut},
journal= {arXiv preprint arXiv:cs/0408026},
year = {2007}
}
备注
Proceedings of COLING 2004 (to appear), 7 pages, 5 figures