Issue No. 04 - April (2009 vol. 31)
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
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.
Pattern matching, Similarity measures, Classifier design and evaluation, Speech recognition and synthesis
F. Mihelič, J. Žibert, N. Pavešić and S. Dobrišek, "An Edit-Distance Model for the Approximate Matching of Timed Strings," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 31, no. , pp. 736-741, 2008.