๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Modelling asynchrony in automatic speech recognition using loosely coupled hidden Markov models

โœ Scribed by H.J. Nock; S.J. Young

Publisher
Wiley (Blackwell Publishing)
Year
2002
Tongue
English
Weight
240 KB
Volume
26
Category
Article
ISSN
0364-0213

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Continuously variable duration hidden Ma
Continuously variable duration hidden Markov models for automatic speech recognition
โœ S.E. Levinson ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 655 KB

During tile past decade, the applicability of hidden Markov models (HMM) to various facets of speech analysi s has been demonstrated in several different experiments. These investigations all rest on the assumption that speech is a quasi-stationary process whose stationary intervals can be identifie

Keyword detection in conversational spee
Keyword detection in conversational speech utterances using hidden Markov model based continuous speech recognition
โœ R.C. Rose ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 213 KB

This paper describes a set of modeling techniques for detecting a small vocabulary of keywords in running conversational speech. The techniques are applied in the context of a hidden Markov model (HMM) based continuous speech recognition (CSR) approach to keyword spotting. The word spotting task is

State clustering in hidden Markov model-
State clustering in hidden Markov model-based continuous speech recognition
โœ S.J. Young; P.C. Woodland ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 535 KB

A key problem in the use of context-dependent hidden Markov models is the need to balance the desired model complexity with the amount of available training data. This paper describes a method which uses a simple agglomerative algorithm to cluster and tie acoustically similar states. The main proper