A speaker-independent automatic speech recognition system is developed using hidden Markov models (HMMs). Simulated annealing and randomized search are used to optimize discrete features of the system, including topologies, parameter ties, context clusters, and the sizes of mixture densities. Domain
Learning discrete hidden Markov models
✍ Scribed by Luís Geraldo P. Meloni
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 151 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1061-3773
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we first extended the semicontinuous hidden Markov model to incorporate multiple code-books. The robustness of the semicontinuous output probability is enhanced by the combination of multiple codewords and multiple codebooks. In addition, we compared the semicontinuous model with the
We discuss how methods based on hidden Markov models performed in the fold-recognition section of the CASP2 experiment. Hidden Markov models were built for a representative set of just over 1,000 structures from the Protein Data Bank (PDB). Each CASP2 target sequence was scored against this library
The binding of a major histocompatibility complex (MHC) molecule to a peptide originating in an antigen is essential to recognizing antigens in immune systems, and it has proved to be important to use computers to predict the peptides that will bind to an MHC molecule. The purpose of this paper is t