基于未排序数据的最小无环序贯变换的增量构造
Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data
摘要：
本文提出了一个有效的算法，为一个字典的输入和输出字符串的列表组成的最小的非循环顺序转换器（ST）的增量建设。该算法推广了构造最小有限状态自动机的已知方法（Daciuk等人，2000）。与Mihov和Maurel（2001）发表的算法不同，它不需要对输入字符串进行排序。新的方法说明了一个应用程序的发音字典。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
