| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slawly (0) - 49 freq slowly (1) - 226 freq slay (2) - 5 freq slawlie (2) - 10 freq slaws (2) - 1 freq lally (2) - 2 freq shawls (2) - 2 freq wawly (2) - 1 freq slawed (2) - 5 freq scaaly (2) - 1 freq swally (2) - 67 freq slyly (2) - 3 freq slawer (2) - 2 freq slaw (2) - 96 freq slarry (2) - 1 freq scaly (2) - 13 freq lowly (2) - 5 freq blawy (2) - 1 freq slangy (2) - 2 freq brawly (2) - 36 freq siowly (2) - 1 freq spawny (2) - 2 freq slaty (2) - 1 freq saaly (2) - 1 freq scowly (2) - 1 freq |
slawly (0) - 49 freq slowly (1) - 226 freq slawlie (2) - 10 freq slowlie (3) - 1 freq shawl (3) - 26 freq lowly (3) - 5 freq siowly (3) - 1 freq scowly (3) - 1 freq sleely (3) - 1 freq slaw (3) - 96 freq slawin (3) - 2 freq slawer (3) - 2 freq slaws (3) - 1 freq slawed (3) - 5 freq slawlik (3) - 2 freq sally (3) - 145 freq slyly (3) - 3 freq swaal (4) - 2 freq selly (4) - 1 freq slewed (4) - 1 freq slow (4) - 142 freq solemly (4) - 2 freq sulkily (4) - 3 freq shawlie (4) - 1 freq saall (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 |
SLAWLY |
| Time to execute Levenshtein function - 0.184906 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.359580 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.027278 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.074078 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.000850 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. |