Results 1 
6 of
6
Fast String Correction with LevenshteinAutomata
 INTERNATIONAL JOURNAL OF DOCUMENT ANALYSIS AND RECOGNITION
, 2002
"... The Levenshteindistance between two words is the minimal number of insertions, deletions or substitutions that are needed to transform one word into the other. Levenshteinautomata of degree n for a word W are defined as finite state automata that regognize the set of all words V where the Levensht ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
The Levenshteindistance between two words is the minimal number of insertions, deletions or substitutions that are needed to transform one word into the other. Levenshteinautomata of degree n for a word W are defined as finite state automata that regognize the set of all words V where the Levenshteindistance between V and W does not exceed n. We show how to compute, for any fixed bound n and any input word W , a deterministic Levenshteinautomaton of degree n for W in time linear in the length of W . Given an electronic dictionary that is implemented in the form of a trie or a finite state automaton, the Levenshteinautomaton for W can be used to control search in the lexicon in such a way that exactly the lexical words V are generated where the Levenshteindistance between V and W does not exceed the given bound. This leads to a very fast method for correcting corrupted input words of unrestricted text using large electronic dictionaries. We then introduce a second method that avoids the explicit computation of Levenshteinautomata and leads to even improved eciency. We also describe how to extend both methods to variants of the Levenshteindistance where further primitive edit operations (transpositions, merges and splits) may be used.
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, FiniteState Automata from Sets of Strings
"... This paper compares various methods for constructing minimal, deterministic, acyclic, nitestate automata from sets of words. ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This paper compares various methods for constructing minimal, deterministic, acyclic, nitestate automata from sets of words.
Experiments with Automata Compression
, 2000
"... Several compression methods of finitestate automata are presented and evaluated. Most compression methods used here are already described in the literature. However, their impact on the size of automata has not been described yet. We fill that gap, presenting results of experiments carried out on a ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Several compression methods of finitestate automata are presented and evaluated. Most compression methods used here are already described in the literature. However, their impact on the size of automata has not been described yet. We fill that gap, presenting results of experiments carried out on automata representing German, and Dutch morphological dictionaries.
How to Squeeze a Lexicon
 Software Practice and Experience
, 2000
"... Minimal acyclic deterministic finite automata (ADFAs) can be used as a compact representation of string sets with fast access time. Creating them with traditional algorithms of DFA minimization is a resource hog when a large number of strings is involved. This paper aims to popularize an efficient b ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Minimal acyclic deterministic finite automata (ADFAs) can be used as a compact representation of string sets with fast access time. Creating them with traditional algorithms of DFA minimization is a resource hog when a large number of strings is involved. This paper aims to popularize an efficient but little known algorithm for creating minimal ADFAs recognizing a finite language, developed independently by several authors. The algorithm is presented for three variants of ADFAs, its minor improvements are discussed, and minimal ADFAs are compared to competitive data structures.
Finite state tools for natural language processing
 Proceedings 14 Tanja Gaustad and Gosse Bouma of the COLING 2000 Workshop &quot;Using Toolsets and Architectures to Build NLP Systems&quot;, Centre Universitaire
"... ..."
FA Minimization heuristics for a class of finite languages
"... . In this paper, we deal with minimization of nite automata associated with nite languages all the words have the same length. This problem arises in the context of Constraint Satisfaction Problems, widely used in AI. We rst give some complexity results which are based on the strong relationship wit ..."
Abstract
 Add to MetaCart
. In this paper, we deal with minimization of nite automata associated with nite languages all the words have the same length. This problem arises in the context of Constraint Satisfaction Problems, widely used in AI. We rst give some complexity results which are based on the strong relationship with covering problems of bipartite graphs. We then use these coverings as a basic tool for the denition of minimization heuristics, and describe some experimental results. 1 Motivations Many AI problems can be expressed as Constraint Satisfaction Problems or CSP for short [Mon74]. A CSP involves a nite set of variables, a nite set of values for the variables and a set of constraints. Each constraint is dened as a relation on some subset of variables and gives the values which are mutually compatible for these variables. A solution is a value assignment to variables that satisfy all the constraints. Most of the CSP's works deal with the problem of computing one solution. Nevertheless, i...