Levenshtein algorithm in C
-
Updated
Sep 8, 2022 - C
Levenshtein algorithm in C
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
Calculates the edit distance between two strings
Spell Checking and Correcting using a HashTable Implementation and the Edit Distance Algorithm in C
Experiments in fuzzy text searching
Efficient and parallel implementation of Smith Waterman edit distance algorithm.
Assignments done for a Parallel Programming course at @ufms.
Analyze string similarity using Levenshtein's distance.
Implementing Edit Distance in C
Possibly the fastest way of computing the Levenshtein distance between two fairly short ASCII strings in Python…
Generalized edit distance command line tool
Dynamic vs Recursion implementation
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."