Incremental construction of minimal acyclic finite state automata and transducers

Authors:
Jan Daciuk;Bruce W. Watson;Richard E. Watson
Affiliations:
Technical University of Gdańsk, Gdańsk, Poland;University of Pretoria, Pretoria, South Africa and Ribbit Software Systems Inc., Kelowna, British Columbia, Canada;Ribbit Software Systems Inc., Kelowna, British Columbia, Canada
Venue:
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Year:
1998

Citing 1
Cited 18

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

A New Czech Morphological Analyser ajka

TSD '01 Proceedings of the 4th International Conference on Text, Speech and Dialogue
FA Minimisation Heuristics for a Class of Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Using Finite State Technology in Natural Language Processing of Basque

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
A new algorithm for the construction of minimal acyclic DFAs

Science of Computer Programming
Incremental construction of minimal acyclic finite-state automata

Computational Linguistics - Special issue on finite-state methods in NLP
Incremental construction of compact acyclic NFAs

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Hopcroft's Algorithm and Cyclic Automata

Language and Automata Theory and Applications
Circular sturmian words and Hopcroft's algorithm

Theoretical Computer Science
NFA reduction algorithms by means of regular inequalities

DLT'03 Proceedings of the 7th international conference on Developments in language theory
From Czech morphology through partial parsing to disambiguation

CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
A challenging family of automata for classical minimization algorithms

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
How many dots are really needed for head-driven chart parsing?

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
A morphological analyzer using hash tables in main memory (MAHT) and a lexical knowledge base

CICLing'12 Proceedings of the 13th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
On state complexity of finite word and tree languages

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Finite state tools for natural language processing

Proceedings of the COLING-2000 Workshop on Using Toolsets and Architectures To Build NLP Systems
From diagnosis of active systems to incremental determinization of finite acyclic automata

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite state automata and transducers. Traditional methods consist of two steps. The first one is to construct a trie, the second one --- to perform minimization. Our approach is to construct an automaton in a single step 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 sorting of the input strings.