Approximate String Matching using Levenshtein Distance algorithm.
Approximate String Matching using Levenshtein Distance algorithm.
Get minimum distance between two strings
Get minimum distance between two strings
(search word lst & {:keys [rank] :or {rank 3}})
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close