An Edit-Distance Model for the Approximate Matching of Timed Strings

Authors:
Simon Dobrišek;Janez Žibert;Nikola Pavešić;France Mihelič
Affiliations:
University of Ljubljana, Ljubljana;University of Ljubljana, Ljubljana;University of Ljubljana, Ljubljana;University of Ljubljana, Ljubljana
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2009

Citing 0
Cited 2

A hash trie filter method for approximate string matching in genomic databases

Applied Intelligence
Querying event sequences by exact match or similarity search: Design and empirical evaluation

Interacting with Computers

Quantified Score

Hi-index	0.14

Visualization

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.