The Optimal and Complete Prompts Lists for Connected Spoken Digit Speech Corpus

연결 숫자음 인식기 학습용 음성DB 녹음을 위한 최적의 대본 작성

This paper describes an efficient algorithm to generate compact and complete prompts lists for connected spoken digits database. In building a connected spoken digit recognizer, we have to acquire speech data in various contexts. However, in many speech databases the lists are made by using random generators. We provide an efficient algorithm that can generate compact and complete lists of digits in various contexts. This paper includes the proof of optimality and completeness of the algorithm.