| Article ID: | iaor19971479 |
| Country: | United States |
| Volume: | 25 |
| Issue: | 1 |
| Start Page Number: | 202 |
| End Page Number: | 206 |
| Publication Date: | Jan 1995 |
| Journal: | IEEE Transactions On Systems, Man and Cybernetics |
| Authors: | Bunke H., Csirik J. |
| Keywords: | programming: dynamic |
In this paper a generalized version of the string matching algorithm by Wagner and Fischer is proposed. It is based on a parameterization of the editing cost. The authors 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 strings A and B, our algorithm computes their edit distance in terms of the parameter r. The authors give the new algorithm, study some of its properties, and discuss potential applications to pattern recognition.