The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2009 vol.31)
pp: 736-741
Simon Dobrišek , University of Ljubljana, Ljubljana
Janez Žibert , University of Ljubljana, Ljubljana
Nikola Pavešić , University of Ljubljana, Ljubljana
France Mihelič , University of Ljubljana, Ljubljana
ABSTRACT
An edit-distance model that can be used for the approximate matching of contiguous and non-contiguous timed strings is presented. The model extends the concept of the weighted string-edit distance by introducing timed edit operations and by making the edit costs time dependent. Special attention is paid to the timed null symbols that are associated with the timed insertions and deletions. The usefulness of the presented model is demonstrated on the classification of phone-recognition errors using the TIMIT speech database.
INDEX TERMS
Pattern matching, Similarity measures, Classifier design and evaluation, Speech recognition and synthesis
CITATION
Simon Dobrišek, Janez Žibert, Nikola Pavešić, France Mihelič, "An Edit-Distance Model for the Approximate Matching of Timed Strings", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.31, no. 4, pp. 736-741, April 2009, doi:10.1109/TPAMI.2008.197
REFERENCES
[1] L. Rabiner and B. Juang, Fundamentals of Speech Recognition. Prentice Hall, 1993.
[2] R. Alur and D.L. Dill, “A Theory of Timed Automata,” Theoretical Computer Science, vol. 126, no. 2, pp. 183-235, 1994.
[3] S. Verwer, M. de Weerdt, and C. Witteveen, “Identifying an Automaton Model for Timed Data,” Proc. Ann. Machine Learning Conf. Belgium and the Netherlands, Y. Saeys, E. Tsiporkova, B.D. Baets, and Y. van de Peer, eds., pp. 57-64, 2006.
[4] J.B. Kruskal, “An Overview of Sequence Comparison,” Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison, D.Sankoff and J. Kruskal, eds., pp. 11-44. CSLI Publications, 1999.
[5] A. Apostolico, “General Pattern Matching,” Algorithms and Theory of Computation Handbook, M.J. Atallah, ed., pp. 13-1-13-22. CRC Press, 1999.
[6] V. Levenshtein, “Binary Codes Capable of Correcting Deletions, Insertions and Reversals,” Soviet Physics-Doklady, vol. 10, no. 8, pp. 707-710, 1966.
[7] R.A. Wagner and M.J. Fisher, “The String-to-String Correction Problem,” J.ACM, vol. 21, no. 1, pp. 168-173, 1974.
[8] W. Masek and M. Paterson, “A Faster Algorithm for Computing String Edit Distances,” J. Computer System Sciences, vol. 20, no. 1, pp. 18-31, 1980.
[9] A.V. Aho, “Algorithms for Finding Patterns in Strings,” Handbook of Theoretical Computer Science, J. Leeuwen, ed., pp. 255-300, Elsevier, 1990.
[10] A. Marzal and E. Vidal, “Computation of Normalized Edit Distance and Applications,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 926-932, Sept. 1993.
[11] H. Bunke and J. Csirik, “Parametric String Edit Distance and Its Application to Pattern Recognition,” IEEE Trans. Systems, Man, and Cybernetics, vol. 25, no. 1, pp. 202-206, 1995.
[12] T. Okuda, E. Tanaka, and T. Kasai, “A Method of Correction of Garbled Words Based on the Levenshtein Metric,” IEEE Trans. Computers, vol. 25, no. 2, pp. 172-177, Feb. 1976.
[13] J.B. Kruskal and M. Liberman, “The Symmetric Time Warping Problem: From Continuous to Discrete,” Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison, D. Sankoff and J. Kruskal, eds., pp. 125-161, CSLI Publications, 1999.
[14] C.S. Myers and L.R. Rabiner, “A Comparative Study of Several Dynamic Time-Warping Algorithms for Connected-Word Recognition,” The Bell System Technical J., vol. 60, no. 5, pp. 1389-1409, 1981.
[15] M.L. Hetland, “A Survey of Recent Methods for Efficient Retrieval of Similar Time Sequences,” Data Mining in Time Series Databases, M. Last, A.Kandel, and H. Bunke, eds., pp. 27-49, World Scientific, 2004.
[16] H. Mannila and P. Ronkainen, “Similarity of Event Sequences,” Proc. Fourth Int'l Workshop Temporal Representation and Reasoning, pp. 136-139, 1997.
[17] M. Mongeau and D. Sankoff, “Comparison of Musical Sequences,” Computers and the Humanities, vol. 24, no. 3, pp. 161-175, 1990.
[18] D. Gibbon, R. Moore, and R. Winski, eds., Handbook of Standards and Resources for Spoken Language Systems. Mouton de Gruyter, Walter deGruyter Publishers, 1997.
[19] G. Doddington, “Word Alignment Issues in ASR Scoring,” Proc. IEEE Automatic Speech Recognition and Understanding Workshop, pp. 630-633, 2003.
[20] The NIST Speech Recognition Scoring Toolkit (SCTK) Version 2.1.4, Nat'l Inst. of Standards and Technology (NIST), http://www.nist.gov/speechtools, 2007.
[21] J.B. Kruskal and D. Sankoff, “An Anthology of Algorithms and Concepts for Sequence Comparisons,” Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison, D. Sankoff and J. Kruskal, eds., pp. 256-310, CSLI Publications, 1999.
[22] Q. Liu, “Interactive and Incremental Learning via a Multisensory Mobile Robot,” PhD dissertation, Univ. of Illinois at Urbana-Champaign, 2001.
[23] The DARPA TIMIT Acoustic-Phonetic Continuous Speech Corpus, CDROM, Nat'l Inst. Standards and Technology (NIST), 1990.
[24] S. Young, G. Evermann, M. Gales, T. Hain, D. Kershaw, G. Moore, J. Odell, D. Ollason, D. Povey, V. Valtchev, and P. Woodland, The HTK Book (for HTK Version 3.4), Eng. Dept., Cambridge Univ., 2006.
[25] A. Cutler, A. Weber, R. Smits, and N. Cooper, “Patterns of English Phoneme Confusions by Native and Non-Native Listeners,” J. Acoustical Soc. of Am., vol. 116, no. 6, pp. 3668-3678, 2004.
[26] S.M. Witt and S.J. Young, “Phone-Level Pronunciation Scoring and Assessment for Interactive Language Learning,” Speech Comm., vol. 30, nos. 2/3, pp. 95-108, 2000.
39 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool