arrow
返回

Scaled random trajectory segment models

delete1998-01-01
delete1
PRE
AI
J
Jacob Goldberger *
D
David Burshtein
DOI:10.1006/csla.1997.0035delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Speech recognition systems that are based on hidden Markov modelling (HMM) assume that the mean trajectory feature vector within a state is constant over time. In recent years, segment models that attempt to describe the dynamics of the speech signal within a phonetic unit have been proposed. Some of these models describe the mean trajectory over time as a random process. In this paper we present the concept of a scaled random trajectory segment model, which aims to overcome the modelling problem created by the fact that segment realizations of the same phonetic unit differ in length. The new model is supported by direct experimental evidence. It offers the following advantages over the standard (non-scaled) model. First, it shows improved performance compared to the non-scaled model. This is demonstrated using phone classification experiments. Second, it yields closed form expressions for the estimated parameters, unlike the previously suggested, non-scaled model, which requires more complicated iterative estimation procedures. (C) 1998 Academic Press Limited.
Keyword:
ALGORITHM

期刊

C
Computer Speech and Language
IF:
3.4
论文数:
1.5K
被引数:
2.6K

机构

暂无机构信息
引用论文

引用论文

暂无论文信息