Miguel
Reputation: 3506
Knuth-Morris-Pratt with Fuzzy String Matching
Does anyone know or have any idea if the KMP algorithm for substring searching can be modified to find not exact matches but approximate ones?
Upvotes: 0
Views: 1259
Answers (1)
Related Questions
- Very Fast string fuzzy matching in R
- Algorithms for "fuzzy matching" strings
- Fuzzy search algorithm (approximate string matching algorithm)
- dictionary-based fuzzy matching
- Fuzzy String matching of Strings in Java
- fuzzy fast string matching and indexing algorithm
- R: String Fuzzy Matching using jarowinkler
- Comparing strings based on similarity?
- how to optimize Knuth Morris Pratt String matching algorithm
- Finding a fuzzy match with bitap algorithm