Spell checking using Damerau–Levenshtein distance
-
Updated
Mar 12, 2024 - C
Spell checking using Damerau–Levenshtein distance
Spell checker in C based on bk-tree and levenshtein distance
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
Add a description, image, and links to the damerau-levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the damerau-levenshtein-distance topic, visit your repo's landing page and select "manage topics."