ISCA Archive Eurospeech 1999
ISCA Archive Eurospeech 1999

Temporal constraints in viterbi alignment for speech recognition in noise

Nestor Becerra Yoma, Lee Luan Ling, Sandra Dotto Stump

This paper addresses the problem of temporal constraints in the Viterbi algorithm using conditional transition probabilities. The results here presented suggest that in a speaker dependent small vocabulary task the statistical modelling of state durations is not relevant if the max and min state duration restrictions are imposed, and that truncated probability densities give better results than a metric previously proposed [1]. Finally, context dependent and context independent temporal restrictions are compared in a connected word speech recognition task and it is shown that the former leads to better results with the same computational load.


doi: 10.21437/Eurospeech.1999-633

Cite as: Yoma, N.B., Ling, L.L., Stump, S.D. (1999) Temporal constraints in viterbi alignment for speech recognition in noise. Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999), 2861-2864, doi: 10.21437/Eurospeech.1999-633

@inproceedings{yoma99_eurospeech,
  author={Nestor Becerra Yoma and Lee Luan Ling and Sandra Dotto Stump},
  title={{Temporal constraints in viterbi alignment for speech recognition in noise}},
  year=1999,
  booktitle={Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999)},
  pages={2861--2864},
  doi={10.21437/Eurospeech.1999-633}
}