Pattern Recognition of Strings With Substitutions, Insertions, Deletions and Generalized Transpositions (0)
Cached
Download Links
- [www.scs.carleton.ca]
- [www.scs.carleton.ca]
- DBLP
Other Repositories/Bibliography
| Venue: | Pattern Recognition |
| Citations: | 8 - 2 self |
BibTeX
@ARTICLE{Oommen_patternrecognition,
author = {B. J. Oommen and R. K. S. Loke},
title = {Pattern Recognition of Strings With Substitutions, Insertions, Deletions and Generalized Transpositions},
journal = {Pattern Recognition},
year = {},
volume = {30},
pages = {30--5}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study the problem of recognizing a string Y which is the noisy version of some unknown string X * chosen from a finite dictionary, H. The traditional case which has been extensively studied in the literature is the one in which Y contains substitution, insertion and deletion (SID) errors. Although some work has been done to extend the traditional set of edit operations to include the straightforward transposition of adjacent characters 2 [14] the problem is unsolved when the transposed characters are themselves subsequently substituted, as is typical in cursive and typewritten script, in molecular biology and in noisy chain-coded boundaries. In this paper we present the first reported solution to the analytic problem of editing one string X to another, Y using these four edit operations. A scheme for obtaining the optimal edit operations has also been given. Both these solutions are optimal for the infinite alphabet case. Using these algorithms we present a syntactic pattern rec...
