DocumentCode
1240243
Title
Parametric string edit distance and its application to pattern recognition
Author
Bunke, H. ; Csirik, J.
Author_Institution
Inst. fur Inf. und Angewandte Math., Bern Univ., Switzerland
Volume
25
Issue
1
fYear
1995
fDate
1/1/1995 12:00:00 AM
Firstpage
202
Lastpage
206
Abstract
A generalized version of the string matching algorithm by Wagner and Fischer (1974) is proposed. It is based on a parametrization of the edit cost. We assume constant cost for any delete and insert operation, but the cost for replacing a symbol is given as a parameter τ. For any two strings A and B, our algorithm computes their edit distance in terms of the parameter τ. We give the new algorithm, study some of its properties, and discuss potential applications to pattern recognition
Keywords
pattern recognition; string matching; deletion; insertion; parametric string edit distance; pattern recognition; string matching algorithm; symbol replacement; Application software; Computer science; Cost function; Dynamic programming; Inference algorithms; Information processing; Pattern matching; Pattern recognition; Prototypes;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
0018-9472
Type
jour
DOI
10.1109/21.362950
Filename
362950
Link To Document