A language model combining n-grams and stochastic finite state automata

Explore this paper's citation graph

Summary

A new kind of language models composed of several local models and a general model linking the local models together and a single hidden Markov model integrated in a single hidden Markov model is described.

Type
preprint
Published
1999-09-05
Cited by
34
References
6

Keywords

Finite-state machine, Computer science, Finite state, Automaton, State (computer science)

References

Cited by

Related papers