Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Minimisation of acyclic deterministic automata in linear time
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Text algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A Discipline of Programming
Modern Information Retrieval
Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Incremental construction and maintenance of minimal finite-state automata
Computational Linguistics
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
Incremental construction of minimal acyclic finite-state automata
Computational Linguistics - Special issue on finite-state methods in NLP
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
Description and analysis of a bottom-up DFA minimization algorithm
Information Processing Letters
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
A Compression Method for Natural Language Automata
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
An automata approach to pattern collections
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Extending enterprise service design knowledge using clustering
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Detecting cloud provisioning errors using an annotated process model
Proceedings of the 8th Workshop on Middleware for Next Generation Internet Computing
| Hi-index | 0.00 |
We present a semi-incremental algorithm for constructing minimal acyclic deterministic finite automata. Such automata are useful for storing sets of words for spell-checking, among other applications. The algorithm is semi-incremental because it maintains the automaton in nearly minimal condition and requires a final minimization step after the last word has been added (during construction).The algorithm derivation proceeds formally (with correctness arguments) from two separate algorithms, one for minimization and one for adding words to acyclic automata. The algorithms are derived in such a way as to be combinable, yielding a semi-incremental one. In practice, the algorithm is both easy to implement and displays good running time performance.