fuzzy string searching, using Levenshtein automaton. Can be used for spell-checking.
-
Updated
Apr 25, 2022 - OCaml
#
levenshtein-automaton
Here are 3 public repositories matching this topic...
ML's radishal Universal Levenshtein Automata library.
ocaml levenshtein levenshtein-distance approximate-string-matching damerau-levenshtein levenshtein-automaton
-
Updated
Jan 5, 2022 - OCaml
Efficient typo-tolerant search in 76 lines of code, with no dependencies.
search search-engine fuzzy-search trie fuzzy-matching levenshtein-distance levenshtein-automaton levenshtein-algorithm trie-structure typo-tolerant
-
Updated
Apr 6, 2024 - Python
Improve this page
Add a description, image, and links to the levenshtein-automaton topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the levenshtein-automaton topic, visit your repo's landing page and select "manage topics."