Name
Abstract | ||
|---|---|---|
The paper presents a new algorithm for estimating the parameters of a hidden stochastic context-free grammar. In contrast to the Inside/Outside (I/O) algorithm it does not require the grammar to be expressed in Chomsky normal form, and thus can operate directly on more natural representations of a grammar. The algorithm uses a trellis-based structure as opposed to the binary branching tree structure used by the I/O algorithm. The form of the trellis is an extension of that used by the Forward/Backward (F/B) algorithm, and as a result the algorithm reduces to the latter for components that can be modelled as finite-state networks. In the same way that a hidden Markov model (HMM) is a stochastic analogue of a finite-state network, the representation used by the new algorithm is a stochastic analogue of a recursive transition network, in which a state may be simple or itself contain an underlying structure. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/ICASSP.1992.225943 | ICASSP'92 Proceedings of the 1992 IEEE international conference on Acoustics, speech and signal processing - Volume 1 |
Keywords | DocType | Volume |
context-free grammars,hidden Markov models,parameter estimation,speech recognition,stochastic processes,HMM,finite-state networks,hidden Markov estimation,hidden Markov model,parameter estimation,recursive transition network,stochastic analog,stochastic context-free grammars,trellis structure | Conference | 1 |
ISSN | ISBN | Citations |
1520-6149 | 0-7803-0532-9 | 9 |
PageRank | References | Authors |
4.48 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julian Kupiec | 1 | 1061 | 381.10 |