In this paper, we describe a new method for constructing minimal, deterministic, acyclic finitestate automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-thefly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings. Our method is fast and significantly lowers memory requirements in comparison to other methods.

No abstract

The need to correct garbled strings arises in many areas of natural language processing. If a dictionary is available that covers all possible input tokens, a natural set of candidates for correcting an erroneous input P is the set of all words in the dictionary for which the Levenshtein distance to P does not exceed a given (small) bound k. In this article we describe methods for efficiently selecting such candidate sets. After introducing as a starting point a basic correction method based on the concept of a "universal Levenshtein automaton," we show how two filtering methods known from the field of approximate text search can be used to improve the basic procedure in a significant way. The first method, which uses standard dictionaries plus dictionaries with reversed words, leads to very short correction times for most classes of input strings. Our evaluation results demonstrate that correction times for fixed-distance bounds depend on the expected number of correction candidates, which decreases for longer input words. Similarly the choice of an optimal filtering method depends on the length of the input words.

We find the exotic matrix bialgebras which correspond to the two nontriangular nonsingular 4 × 4 R-matrices in the classification of Hietarinta, namely, R S0,3 and R S1,4 . We find two new exotic bialgebras S03 and S14 which are not deformations of the of the classical algebras of functions on GL(2) or GL(1|1). With this we finalize the classification of the matrix bialgebras which unital associative algebras generated by four elements. We also find the corresponding dual bialgebras of these new exotic bialgebras and study their representation theory in detail. We also discuss in detail a special case of R S1,4 in which the corresponding algebra turns out to be a special case of the two-parameter quantum group deformation GL p,q (2).