Trainable grammars for speech recognition

This paper presents a generalization of these algorithms to certain denumerable‐state, hidden Markov processes that permits automatic training of the stochastic analog of an arbitrary context free grammar.