Parallel intersection and serial composition of finite state transducers

Authors:
Mike Reape;Henry Thompson
Affiliations:
University of Edinburgh, Edinburgh, Scotland;University of Edinburgh, Edinburgh, Scotland
Venue:
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Year:
1988

Citing 3
Cited 2

Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Constraint propagation in Kimmo systems

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Computational complexity in two-level morphology

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics

On the generative power of two-level morphological rules

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Automatic learning of word transducers from examples

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a linguistically expressive and easy to implement parallel semantics for quasi-deterministic finite state transducers(FSTS) used as acceptors. Algorithms are given for determining acceptance of pairs of phoneme strings given a parallel suite of such transducers and for constructing the equivalent single transducer by parallel intersection. An algorithm for constructing the serial composition of a sequence of such transducers is also given. This algorithm can produce generally nondeterministic FSTS and an algorithm is presented for eliminating the unacceptable nondeterminism. Finally, the work is discussed in the context of other work on finite state transducers.