| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sloalie (0) - 1 freq slowlie (1) - 1 freq slaalie (1) - 1 freq sloapin (2) - 1 freq loanie (2) - 2 freq slolee (2) - 1 freq slatie (2) - 2 freq sleelie (2) - 1 freq snorlie (2) - 1 freq toalie (2) - 1 freq slowlike (2) - 1 freq lonlie (2) - 1 freq goalie (2) - 11 freq coalie (2) - 1 freq slochie (2) - 3 freq slawlie (2) - 10 freq shoppie (3) - 50 freq natalie (3) - 7 freq stealin (3) - 34 freq lowrie (3) - 19 freq sadlie (3) - 2 freq soae (3) - 1 freq clonlee (3) - 2 freq stollin (3) - 1 freq scaldie (3) - 2 freq |
sloalie (0) - 1 freq slaalie (1) - 1 freq slolee (2) - 1 freq sleelie (2) - 1 freq slowlie (2) - 1 freq sillie (3) - 2 freq seillie (3) - 2 freq sullie (3) - 2 freq slawlie (3) - 10 freq sellie (3) - 2 freq slatie (3) - 2 freq sollit (4) - 1 freq sulie (4) - 1 freq smellie (4) - 1 freq slowly (4) - 229 freq allie (4) - 9 freq slayin (4) - 1 freq slane (4) - 1 freq slyly (4) - 3 freq sairlie (4) - 6 freq slaurie (4) - 1 freq stylie (4) - 1 freq sculie (4) - 1 freq stole (4) - 52 freq sole (4) - 19 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 |
SLOALIE |
| Time to execute Levenshtein function - 0.389827 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.771065 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.029081 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.089000 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.000923 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. |