Direct Construction of Minimal Acyclic Subsequential Transducers

Authors:
Stoyan Mihov;Denis Maurel
Affiliations:
-;-
Venue:
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Year:
2000

Citing 5
Cited 0

Psuedo-minimal transducer

Theoretical Computer Science - Special issue on implementing automata
Data Structures and Algorithms

Data Structures and Algorithms
Incremental construction of minimal acyclic finite-state automata

Computational Linguistics - Special issue on finite-state methods in NLP
Finite-state transducers in language and speech processing

Computational Linguistics
On some applications of finite-state automata theory to natural language processing

Natural Language Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for direct building of minimal acyclic subsequential transducer, which represents a finite relation given as a sorted list of words with their outputs. The algorithm constructs the minimal transducer directly - without constructing intermediate tree-like or pseudo-minimal transducers. In NLP applications our algorithm provides significantly better efficiency than the other algorithms building minimal transducer for large-scale natural language dictionaries. Some experimental comparisons are presented at the end of the paper.