A Dynamic Programming Algorithm for the Distance Between Two Finite Areas
作者： Roger K. Moore
DOI: 10.1109/TPAMI.1979.4766879
关键词:
摘要: The problems of speech recognition and orthographic word correction have been greatly mitigated by the use dynamic programming techniques for finding distance between two finite sequences. This paper extends technique into dimensions, presents an algorithm areas. Applications are suggested.
computer.org
sci-hub.se 参考文章(6)
Robert A. Wagner, Michael J. Fischer, The String-to-String Correction Problem Journal of the ACM. ,vol. 21, pp. 168- 173 ,(1974) , 10.1145/321796.321811
G. White, R. Neely, Speech recognition experiments with linear predication, bandpass filtering, and dynamic programming IEEE Transactions on Acoustics, Speech, and Signal Processing. ,vol. 24, pp. 183- 188 ,(1976) , 10.1109/TASSP.1976.1162779
Peter H Sellers, An algorithm for the distance between two finite sequences Journal of Combinatorial Theory, Series A. ,vol. 16, pp. 253- 258 ,(1974) , 10.1016/0097-3165(74)90050-8
Teruo Okuda, Eiichi Tanaka, Tamotsu Kasai, A Method for the Correction of Garbled Words Based on the Levenshtein Metric IEEE Transactions on Computers. ,vol. 25, pp. 172- 178 ,(1976) , 10.1109/TC.1976.5009232
F. Itakura, Minimum prediction residual principle applied to speech recognition IEEE Transactions on Acoustics, Speech, and Signal Processing. ,vol. 23, pp. 154- 158 ,(1975) , 10.1109/TASSP.1975.1162641
L. Bahl, F. Jelinek, Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition IEEE Transactions on Information Theory. ,vol. 21, pp. 404- 411 ,(1975) , 10.1109/TIT.1975.1055419