| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dreary (0) - 13 freq deary (1) - 4 freq drear (1) - 10 freq dreamy (1) - 9 freq dreams (2) - 152 freq drars (2) - 2 freq reamy (2) - 2 freq treaty (2) - 21 freq draars (2) - 37 freq creamy (2) - 18 freq dearly (2) - 13 freq dear (2) - 419 freq rear (2) - 29 freq dream' (2) - 1 freq drearie (2) - 1 freq dray (2) - 4 freq draar (2) - 6 freq greasy (2) - 23 freq dreame (2) - 6 freq friary (2) - 2 freq dietary (2) - 1 freq cleary (2) - 1 freq freaky (2) - 4 freq drearily (2) - 1 freq 'ready (2) - 2 freq |
dreary (0) - 13 freq drear (1) - 10 freq drearie (2) - 1 freq derry (2) - 49 freq drar (2) - 1 freq draar (2) - 6 freq deary (2) - 4 freq dreamy (2) - 9 freq dear' (3) - 1 freq derri (3) - 4 freq drearily (3) - 1 freq darry (3) - 1 freq dears (3) - 12 freq diary (3) - 43 freq dread (3) - 30 freq dream (3) - 251 freq decry (3) - 2 freq draaer (3) - 1 freq dietary (3) - 1 freq friary (3) - 2 freq dear (3) - 419 freq rear (3) - 29 freq dearly (3) - 13 freq drars (3) - 2 freq dearer (3) - 8 freq |
SoundEx code - D660 dreary - 13 freq drawer - 131 freq dryer - 5 freq drear - 10 freq dearer - 8 freq drier - 9 freq durer - 1 freq draar - 6 freq drahr - 1 freq drearie - 1 freq dourer - 2 freq drar - 1 freq duror - 1 freq draaer - 1 freq draer - 1 freq |
MetaPhone code - TRR terrier - 13 freq terror - 39 freq dreary - 13 freq drear - 10 freq dearer - 8 freq trurh - 1 freq drier - 9 freq durer - 1 freq draar - 6 freq truer - 5 freq drahr - 1 freq terrour - 1 freq drearie - 1 freq dourer - 2 freq drar - 1 freq tarrier - 1 freq duror - 1 freq draaer - 1 freq truiro - 1 freq draer - 1 freq |
DREARY |
| Time to execute Levenshtein function - 0.203625 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.339998 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.027922 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.037125 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.000828 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. |