An introduction to formal language theory
An introduction to formal language theory
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Incremental construction of minimal acyclic finite state automata and transducers
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Incremental construction and maintenance of minimal finite-state automata
Computational Linguistics
Direct Construction of Minimal Acyclic Subsequential Transducers
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Experiments with Automata Compression
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Optimal insertion in deterministic DAWGs
Theoretical Computer Science
Handwritten Word Recognition based on Structural Characteristics and Lexical Support
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
Proper Names Extraction from Fax Images Combining Textual and Image Features
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
A new algorithm for the construction of minimal acyclic DFAs
Science of Computer Programming
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic
Computational Linguistics - Special issue on finite-state methods in NLP
Reducing memory requirements in reachability-based finite automata operations
Software—Practice & Experience
A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
Journal of Functional Programming
Incremental construction of compact acyclic NFAs
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Revisiting dictionary-based compression: Research Articles
Software—Practice & Experience
Fast Approximate Search in Large Dictionaries
Computational Linguistics
Computational Linguistics
LZ trie and dictionary compression
Software—Practice & Experience
Exact enumeration of acyclic deterministic automata
Discrete Applied Mathematics
Incremental construction of minimal deterministic finite cover automata
Theoretical Computer Science - Implementation and application of automata
Incremental construction of minimal acyclic sequential transducers from unsorted data
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Efficient dictionary-based text rewriting using subsequential transducers†
Natural Language Engineering
A Hybrid Approach to Word Segmentation of Vietnamese Texts
Language and Automata Theory and Applications
Natural Language Engineering
Finite-State Technology as a Programming Environment
CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
Transducer Minimization and Information Compression for NooJ Dictionaries
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Finite-state description of Vietnamese reduplication
ALR7 Proceedings of the 7th Workshop on Asian Language Resources
Exact enumeration of acyclic deterministic automata
Discrete Applied Mathematics
Implementation of dictionaries via automata and decision trees
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
fsm2 - a scripting language interpreter for manipulating weighted finite-state automata
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Reducing nondeterministic finite automata with SAT solvers
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
On building minimal automaton for subset matching queries
Information Processing Letters
Indexing methods for approximate dictionary searching: Comparative analysis
Journal of Experimental Algorithmics (JEA)
Large-scale training of SVMs with automata kernels
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Regional vs. global robust spelling correction
CICLing'06 Proceedings of the 7th international conference on Computational Linguistics and Intelligent Text Processing
Regional versus global finite-state error repair
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Spelling correction on technical documents
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Regional finite-state error repair
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
An incremental algorithm for constructing minimal deterministic finite cover automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Incremental and semi-incremental construction of pseudo-minimal automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Finite state tools for natural language processing
Proceedings of the COLING-2000 Workshop on Using Toolsets and Architectures To Build NLP Systems
Book review: finite state morphology
Computational Linguistics
Cycle-aware minimization of acyclic deterministic finite-state automata
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state 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-the-fly. 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.