Efficient string matching with k mismatches
Theoretical Computer Science
SIAM Journal on Computing
Fast parallel and serial approximate string matching
Journal of Algorithms
Fast algorithms for approximately counting mismatches
Information Processing Letters
Approximate string matching: a simpler faster algorithm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An Extension of the String-to-String Correction Problem
Journal of the ACM (JACM)
Information Processing Letters
Information and Computation
On the complexity of the Extended String-to-String Correction Problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Stanford: probabilistic edit distance metrics for STS
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
Probabilistic finite state machines for regression-based MT evaluation
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
SPEDE: probabilistic edit distance metrics for MT evaluation
WMT '12 Proceedings of the Seventh Workshop on Statistical Machine Translation
| Hi-index | 5.23 |
There is no known algorithm that solves the general case of the approximate edit distance problem, where the edit operations are insertion, deletion, mismatch, and swap, in time o(nm), where n is the length of the text and m is the length of the pattern. In the effort to study this problem, the edit operations have been analyzed independently. Karloff [10] showed an algorithm that approximates the edit distance problem with only the mismatch operation in time O(1@e^2nlog^3m). Amir et al. [4] showed that if the only edit operations allowed are swap and mismatch, then the exact edit distance problem can be solved in time O(nmlogm). In this paper, we discuss the problem of approximate edit distance with swap and mismatch. We show a randomized O(1@e^3nlognlog^3m) time algorithm for the problem. The algorithm guarantees an approximation factor of (1+@e) with probability of at least 1-1n.