| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slowly (0) - 226 freq siowly (1) - 1 freq lowly (1) - 5 freq slawly (1) - 49 freq scowly (1) - 1 freq lolly (2) - 1 freq slowed (2) - 17 freq lonly (2) - 2 freq slowlie (2) - 1 freq jowly (2) - 2 freq lowsly (2) - 1 freq sowl (2) - 128 freq snowy (2) - 4 freq snodly (2) - 1 freq slowan (2) - 1 freq blowsy (2) - 1 freq slows (2) - 4 freq loly (2) - 1 freq blowy (2) - 1 freq scowlt (2) - 2 freq slowen (2) - 1 freq slower (2) - 13 freq sleely (2) - 1 freq slyly (2) - 3 freq sloppy (2) - 1 freq |
slowly (0) - 226 freq slawly (1) - 49 freq slowlie (2) - 1 freq scowly (2) - 1 freq siowly (2) - 1 freq lowly (2) - 5 freq sleely (3) - 1 freq slowen (3) - 1 freq slyly (3) - 3 freq slower (3) - 13 freq scowl (3) - 10 freq slows (3) - 4 freq slow (3) - 142 freq slowin (3) - 13 freq slawlie (3) - 10 freq slowed (3) - 17 freq slowan (3) - 1 freq sowl (3) - 128 freq solely (4) - 3 freq slawlik (4) - 2 freq solway (4) - 11 freq slawed (4) - 5 freq sowel (4) - 87 freq sulkily (4) - 3 freq slowlike (4) - 1 freq |
SoundEx code - S440 slowly - 226 freq schoolhill - 3 freq slawly - 49 freq slawlie - 10 freq sleely - 1 freq slyly - 3 freq sloalie - 1 freq slaalie - 1 freq sleelie - 1 freq solely - 3 freq shale-ile - 1 freq slowlie - 1 freq skellyhill - 2 freq slolee - 1 freq solihull - 1 freq |
MetaPhone code - SLL slowly - 226 freq slawly - 49 freq slawlie - 10 freq sleely - 1 freq slyly - 3 freq sloalie - 1 freq slaalie - 1 freq sleelie - 1 freq sowl'll - 1 freq solely - 3 freq slowlie - 1 freq slolee - 1 freq |
SLOWLY |
| Time to execute Levenshtein function - 0.301547 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.559497 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.026727 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.069612 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000852 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |