ISCA Archive ICSLP 2000
ISCA Archive ICSLP 2000

Optimization of units for continuous-digit recognition task

Sachin S. Kajarakar, Hynek Hermansky

The choice of units, sub-word or whole-word, is generally based on the size of the vocabulary and the amount of training data. In this work, we have introduced new constraints on the units: 1) they should contain sufficient statistics of the features and 2) they should contain sufficient statistics of the vocabulary. This led to minimization of two cost functions, first based on the confusion between the features and the units and the second based on the confusion between the units and the words. We minimized first cost function by forming broad phone classes that were less confusing among themselves than the phones. The second cost function was minimized by coding the word-specific phone sequences. On the continuous digit recognition task, the broad classes performed worse than the phones. The word-specific phone sequences however significantly improved the performance over both the phones and the whole-word units. In this paper we discuss the new constraints, our specific implementation of the cost functions, and the corresponding recognition performance.


doi: 10.21437/ICSLP.2000-325

Cite as: Kajarakar, S.S., Hermansky, H. (2000) Optimization of units for continuous-digit recognition task. Proc. 6th International Conference on Spoken Language Processing (ICSLP 2000), vol. 2, 539-542, doi: 10.21437/ICSLP.2000-325

@inproceedings{kajarakar00_icslp,
  author={Sachin S. Kajarakar and Hynek Hermansky},
  title={{Optimization of units for continuous-digit recognition task}},
  year=2000,
  booktitle={Proc. 6th International Conference on Spoken Language Processing (ICSLP 2000)},
  pages={vol. 2, 539-542},
  doi={10.21437/ICSLP.2000-325}
}