Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data

Details Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data

2004-08-10

arxiv.org/abs/cs/0408026v1

Computer Science

Computation and Language

Proceedings of COLING 2004 (to appear), 7 pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-689397