Incremental construction of compact acyclic NFAs

Authors:
Kyriakos N. Sgarbas;Nikos D. Fakotakis;George K. Kokkinakis
Affiliations:
University of Patras, Greece;University of Patras, Greece;University of Patras, Greece
Venue:
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Year:
2001

Citing 5
Cited 2

Minimisation of acyclic deterministic automata in linear time

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Direct Construction of Compact Directed Acyclic Word Graphs

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
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

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
Minimizing state transition model for multiclassification by mixed-integer programming

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents and analyzes an incremental algorithm for the construction of Acyclic Non-deterministic Finite-state Automata (NFA). Automata of this type are quite useful in computational linguistics, especially for storing lexicons. The proposed algorithm produces compact NFAs, i.e. NFAs that do not contain equivalent states. Unlike Deterministic Finite-state Automata (DFA), this property is not sufficient to ensure minimality, but still the resulting NFAs are considerably smaller than the minimal DFAs for the same languages.