Trapezoidal DP matching with time reversibility
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 1239-1242
- https://doi.org/10.1109/icassp.1982.1171516
Abstract
DP matching is widely used in speech recognition. But none of the conventional formulations (Rectangular DP Matching) seem to have all the three properties: pattern commutativeness, time reversibility, and linear matching consistency. In this paper, a new formulation named "Trapezoidal DP Matching" is proposed, which preserves time reversibility and can have all the three properties. In addition, the following points are clarified; (1) The formulation gives a better approximation of continuous-time pattern distance, and is expected to improve recognition accuracy. (2) It has an effect of smoothing the weighting coefficients on local distances. (3) It provides a clear viewpoint on the relationship between weighting coefficients and the normalized time. (4) Its evaluation is reliable even for a transient portion matching.Keywords
This publication has 4 references indexed in Scilit:
- Performance tradeoffs in dynamic time warping algorithms for isolated word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Dynamic programming algorithm optimization for spoken word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- Speech recognition experiments with linear predication, bandpass filtering, and dynamic programmingIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- Automatic recognition of 200 wordsInternational Journal of Man-Machine Studies, 1970