A number of automatic lexicon construction methods have been proposed in recent years. Such approaches employ a dynamic programming (DP) match to collect statistics concerning differences between the observed phone sequence and that which was predicted by a standard lexicon. A more expressive lexicon is then constructed based upon the collected statistics, offering a more accurate phone-to-word mapping for use within speech recognition systems. We show that the standard DP procedure leads to the introduction of spurious matches, which reduces the quality of any subsequent processing based upon the DP provided matches. In order to remove this deficiency, an iterative DP match procedure, using individual phone confusion probabilities is outlined. It was found that the iterative DP match significantly reduced the number of equi-probable matches, to the extent that for the vast majority of utterances, only one possible DP mapping resulted, thereby improving the quality of generated statistics.
Cite as: Hanna, P., Stewart, D., Ming, J. (1999) The application of an improved DP match for automatic lexicon generation. Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999), 475-478, doi: 10.21437/Eurospeech.1999-122
@inproceedings{hanna99_eurospeech,
author={Philip Hanna and Darryl Stewart and Ji Ming},
title={{The application of an improved DP match for automatic lexicon generation}},
year=1999,
booktitle={Proc. 6th European Conference on Speech Communication and Technology (Eurospeech 1999)},
pages={475--478},
doi={10.21437/Eurospeech.1999-122}
}