### Abstract

String matching is a useful concept in pattern recognition that is constantly receiving attention from both theoretical and practical points of view. In this paper we propose a generalized version of the string matching algorithm by Wagner and Fischer [1]. 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 r. For any two given strings A and B, our algorithm computes the edit distance of A and B in terms of the parameter r. We give the new algorithm and study some of its properties. Its time complexity is O(n^{2}-m), where n and m are the lengths of the two strings to be compared and n ≤ m. We also discuss potential applications of the new string distance to pattern recognition. Finally, we present some experimental results.

Original language | English |
---|---|

Title of host publication | Conference B |

Subtitle of host publication | Pattern Recognition Methodology and Systems |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 549-552 |

Number of pages | 4 |

Volume | 2 |

ISBN (Print) | 0818629150 |

DOIs | |

Publication status | Published - Jan 1 1992 |

Event | 11th IAPR International Conference on Pattern Recognition, IAPR 1992 - The Hague, Netherlands Duration: Aug 30 1992 → Sep 3 1992 |

### Other

Other | 11th IAPR International Conference on Pattern Recognition, IAPR 1992 |
---|---|

Country | Netherlands |

City | The Hague |

Period | 8/30/92 → 9/3/92 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Vision and Pattern Recognition

### Cite this

*Conference B: Pattern Recognition Methodology and Systems*(Vol. 2, pp. 549-552). [201838] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPR.1992.201838

**Inference of edit costs using parametric String matching.** / Bunke, H.; Csirik, J.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Conference B: Pattern Recognition Methodology and Systems.*vol. 2, 201838, Institute of Electrical and Electronics Engineers Inc., pp. 549-552, 11th IAPR International Conference on Pattern Recognition, IAPR 1992, The Hague, Netherlands, 8/30/92. https://doi.org/10.1109/ICPR.1992.201838

}

TY - GEN

T1 - Inference of edit costs using parametric String matching

AU - Bunke, H.

AU - Csirik, J.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - String matching is a useful concept in pattern recognition that is constantly receiving attention from both theoretical and practical points of view. In this paper we propose a generalized version of the string matching algorithm by Wagner and Fischer [1]. 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 r. For any two given strings A and B, our algorithm computes the edit distance of A and B in terms of the parameter r. We give the new algorithm and study some of its properties. Its time complexity is O(n2-m), where n and m are the lengths of the two strings to be compared and n ≤ m. We also discuss potential applications of the new string distance to pattern recognition. Finally, we present some experimental results.

AB - String matching is a useful concept in pattern recognition that is constantly receiving attention from both theoretical and practical points of view. In this paper we propose a generalized version of the string matching algorithm by Wagner and Fischer [1]. 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 r. For any two given strings A and B, our algorithm computes the edit distance of A and B in terms of the parameter r. We give the new algorithm and study some of its properties. Its time complexity is O(n2-m), where n and m are the lengths of the two strings to be compared and n ≤ m. We also discuss potential applications of the new string distance to pattern recognition. Finally, we present some experimental results.

UR - http://www.scopus.com/inward/record.url?scp=0042629524&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042629524&partnerID=8YFLogxK

U2 - 10.1109/ICPR.1992.201838

DO - 10.1109/ICPR.1992.201838

M3 - Conference contribution

AN - SCOPUS:0042629524

SN - 0818629150

VL - 2

SP - 549

EP - 552

BT - Conference B

PB - Institute of Electrical and Electronics Engineers Inc.

ER -