Hi Christian, Am Sonntag, 18. August 2013 18:52:54 UTC+2 schrieb Christian Sperandio: > > Hi, > > I wrote a set of functions to compare 2 words managing the keyboard > mistakes. The common mistakes are insertion, deletion, substitution or > inversion. >
This sound like you're looking for an implementation of the levinstein distance. Incanter, e.g. has an implementation http://clojuredocs.org/incanter/1.2.3-SNAPSHOT/incanter.stats/levenshtein-distance -billy. -- -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
