GitHub - GZHoffie/approximate-string-matching: A repository of experimental code and benchmark for greedy/dynamic programming approximate string matching algorithms.
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations | PLOS ONE
![Hybrid Algorithm for Approximate String Matching to be used for Information Retrieval | Semantic Scholar Hybrid Algorithm for Approximate String Matching to be used for Information Retrieval | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/3da07891d9e37a5930851ede59ba67914c6fc0ca/3-Table2-1.png)
Hybrid Algorithm for Approximate String Matching to be used for Information Retrieval | Semantic Scholar
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations | PLOS ONE
GitHub - Andreshk/ApproximateStringMatching: Detailed Levenshtein distance algorithm + several chosen approximate string matching algorithms
![Fuzzy String Match With Python on Large Datasets and Why You Should Not Use FuzzyWuzzy | by Alina Zhang | Towards Data Science Fuzzy String Match With Python on Large Datasets and Why You Should Not Use FuzzyWuzzy | by Alina Zhang | Towards Data Science](https://miro.medium.com/max/1000/1*1cLBiFHp0kLvSjKYHuo3RQ.jpeg)