Minimisation of acyclic deterministic automata in linear time
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Applications of finite automata representing large vocabularies
Software—Practice & Experience
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Incremental construction of minimal acyclic finite-state automata
Computational Linguistics - Special issue on finite-state methods in NLP
A new algorithm for the construction of minimal acyclic DFAs
Science of Computer Programming
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
XML rules for enclitic segmentation
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
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
COLE experiments at QA@CLEF 2004 spanish monolingual track
CLEF'04 Proceedings of the 5th conference on Cross-Language Evaluation Forum: multilingual Information Access for Text, Speech and Images
Regional finite-state error repair
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
| Hi-index | 0.02 |
We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We outline the most important methods, including the traditional ones (which consist of the combination of two phases: insertion of words and minimization of the partial automaton) and the incremental algorithms (which add new words one by one and minimize the resulting automaton on-the-fly, being much faster and having significantly lower memory requirements). We analyze their main features in order to provide some improvements for incremental constructions, and a general architecture that is needed to implement large dictionaries in natural language processing (NLP) applications.