|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Recognition of Noisy Subsequences Using Constrained Edit Distances
May 1987 (vol. 9 no. 5)
pp. 676-685
| ASCII Text | x | ||
| B. John Oommen, "Recognition of Noisy Subsequences Using Constrained Edit Distances," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 9, no. 5, pp. 676-685, May, 1987. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.1987.4767962, author = {B. John Oommen}, title = {Recognition of Noisy Subsequences Using Constrained Edit Distances}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {9}, number = {5}, issn = {0162-8828}, year = {1987}, pages = {676-685}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.1987.4767962}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - Recognition of Noisy Subsequences Using Constrained Edit Distances IS - 5 SN - 0162-8828 SP676 EP685 EPD - 676-685 A1 - B. John Oommen, PY - 1987 VL - 9 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
Let X* be any unknown word from a finite dictionary H. Let U be any arbitrary subsequence of X*. We consider the problem of estimating X* by processing Y, which is a noisy version of U. We do this by defining the constrained edit distance between XH and Y subject to any arbitrary edit constraint involving the number and type of edit operations to be performed. An algorithm to compute this constrained edit distance has been presented. Although in general the algorithm has a cubic time complexity, within the framework of our solution the algorithm possesses a quadratic time complexity. Recognition using the constrained edit distance as a criterion demonstrates remarkable accuracy. Experimental results which involve strings of lengths between 40 and 80 and which contain an average of 26.547 errors per string demonstrate that the scheme has about 99.5 percent accuracy.
Citation:
B. John Oommen, "Recognition of Noisy Subsequences Using Constrained Edit Distances," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 9, no. 5, pp. 676-685, May 1987, doi:10.1109/TPAMI.1987.4767962
Usage of this product signifies your acceptance of the Terms of Use.