| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drearily (0) - 1 freq dreamily (1) - 1 freq wearily (2) - 1 freq dearly (2) - 13 freq dreary (2) - 13 freq readily (2) - 7 freq drearie (2) - 1 freq crazily (3) - 2 freq clearly (3) - 140 freq dreaming (3) - 3 freq steadily (3) - 6 freq verily (3) - 2 freq drear (3) - 10 freq drowsily (3) - 1 freq early (3) - 358 freq greedily (3) - 1 freq reality (3) - 111 freq realy (3) - 2 freq dreamin' (3) - 1 freq dreadin (3) - 8 freq warily (3) - 3 freq daily (3) - 108 freq rearin (3) - 8 freq yearly (3) - 10 freq 'really (3) - 6 freq |
drearily (0) - 1 freq dreamily (2) - 1 freq drearie (3) - 1 freq dreary (3) - 13 freq dearly (3) - 13 freq derkly (4) - 1 freq rarely (4) - 43 freq merrily (4) - 5 freq dreezil (4) - 2 freq drear (4) - 10 freq darkly (4) - 2 freq reuril (4) - 1 freq drily (4) - 1 freq wearily (4) - 1 freq readily (4) - 7 freq dervil (5) - 1 freq drowsily (5) - 1 freq dreel (5) - 26 freq drill (5) - 51 freq derrida (5) - 1 freq darkley (5) - 7 freq rairly (5) - 1 freq realiy (5) - 1 freq drars (5) - 2 freq dreamy (5) - 9 freq |
SoundEx code - D664 drearily - 1 freq |
MetaPhone code - TRRL drearily - 1 freq |
DREARILY |
| Time to execute Levenshtein function - 0.199012 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.343803 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.027137 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.036754 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.000817 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. |