Joining composition and trimming of finite-state transducers

Authors:
Johannes Bubenzer;Kay-Michael Würzner
Affiliations:
University of Potsdam;University of Potsdam
Venue:
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Year:
2009

Citing 8
Cited 0

On finding the strongly connected components in a directed graph

Information Processing Letters
Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
Minimization algorithms for sequential transducers

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Semirings, Automata and Languages

Semirings, Automata and Languages
Introduction to Algorithms

Introduction to Algorithms
Finite-state transducers in language and speech processing

Computational Linguistics
OpenFst: a general and efficient weighted finite-state transducer library

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

The composition of two (weighted) finite-state transducers is usually carried out in two steps: In the first step, all accessible states of the result are constructed regardless of their co-accessibility. Non-coaccessible states are removed afterwards in the second step. This approach can lead to huge intermediate automata with only a fraction of their states being useful in the end. We present a novel composition algorithm which avoids the construction of non useful states by using a single depth-first traversal while having the same asymptotic complexity as the existing approaches.