| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slowlie (0) - 1 freq slawlie (1) - 10 freq sloalie (1) - 1 freq slowlike (1) - 1 freq slowly (2) - 229 freq seowlin (2) - 1 freq slawlik (2) - 2 freq dowlie (2) - 3 freq slowin (2) - 14 freq scowlin (2) - 2 freq shawlie (2) - 1 freq slochie (2) - 3 freq powlie (2) - 1 freq stowfie (2) - 1 freq bowlie (2) - 7 freq showdie (2) - 1 freq gowlie (2) - 2 freq stowie (2) - 2 freq sowie (2) - 1 freq lonlie (2) - 1 freq lowdie (2) - 6 freq sleelie (2) - 1 freq lowrie (2) - 19 freq slaalie (2) - 1 freq slolee (2) - 1 freq |
slowlie (0) - 1 freq slawlie (1) - 10 freq slowlike (2) - 1 freq slowly (2) - 229 freq sloalie (2) - 1 freq sleelie (3) - 1 freq slaalie (3) - 1 freq slolee (3) - 1 freq shawlie (3) - 1 freq slawly (3) - 49 freq slowin (3) - 14 freq slawlik (3) - 2 freq slawin (4) - 2 freq slowed (4) - 17 freq slowen (4) - 1 freq sellie (4) - 2 freq sowl (4) - 128 freq scowly (4) - 1 freq sillie (4) - 2 freq lowly (4) - 5 freq scowl (4) - 10 freq slow (4) - 153 freq slowan (4) - 1 freq slows (4) - 5 freq scowlin (4) - 2 freq |
SoundEx code - S440 slowly - 229 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 - 229 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 |
SLOWLIE |
| Time to execute Levenshtein function - 0.194254 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.349100 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.027425 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.036945 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.000912 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. |