Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Data Structures and Algorithms
Data Structures and Algorithms
Nine Issues in Speech Translation
Machine Translation
Incremental speech translation
Incremental speech translation
| Hi-index | 0.00 |
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an automaton under construction, the larcs which it reflects and the lattice nodes at their origins and extremities. An extension of the algorithm permits the inclusion of null, or epsilon, arcs in the output automaton. The algorithm has been successfully applied to lattices derived from dictionaries, i.e. very large corpora of strings.