An effective algorithm for string correction using generalized edit distance—II. Computational complexity of the algorithm and some applications
- 31 December 1981
- journal article
- Published by Elsevier in Information Sciences
- Vol. 23 (3), 201-217
- https://doi.org/10.1016/0020-0255(81)90056-6
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- Syntactic Decision Rules for Recognition of Spoken Words and Phrases Using a Stochastic AutomatonIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- A Method for the Correction of Garbled Words Based on the Levenshtein MetricIEEE Transactions on Computers, 1976
- A study of errors, error-proneness, and error diagnosis in CobolCommunications of the ACM, 1976
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- Stochastic Syntactic Decoding for Pattern ClassificationIEEE Transactions on Computers, 1975
- An Extension of the String-to-String Correction ProblemJournal of the ACM, 1975
- The Viterbi algorithm as an aid in text recognition (Corresp.)IEEE Transactions on Information Theory, 1975
- A Contextual Postprocessing System for Error Correction Using Binary n-GramsIEEE Transactions on Computers, 1974
- Spelling correction in systems programsCommunications of the ACM, 1970