| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drear (0) - 10 freq dream (1) - 259 freq dreary (1) - 13 freq drar (1) - 1 freq rear (1) - 29 freq dear (1) - 425 freq dread (1) - 34 freq draar (1) - 6 freq cream (2) - 139 freq de'r (2) - 51 freq 'bear (2) - 1 freq great (2) - 1293 freq re'r (2) - 1 freq pear (2) - 9 freq crerar (2) - 1 freq swear (2) - 63 freq -year (2) - 1 freq clear (2) - 492 freq dreep (2) - 26 freq creak (2) - 13 freq draa (2) - 51 freq dreym (2) - 9 freq friar (2) - 1 freq tread (2) - 13 freq dress (2) - 98 freq |
drear (0) - 10 freq draar (1) - 6 freq drar (1) - 1 freq dreary (1) - 13 freq dryer (2) - 5 freq drearie (2) - 1 freq durer (2) - 1 freq drier (2) - 9 freq draaer (2) - 2 freq dread (2) - 34 freq dream (2) - 259 freq dear (2) - 425 freq rear (2) - 29 freq drat (3) - 2 freq dcer (3) - 1 freq bruar (3) - 5 freq freear (3) - 1 freq daar (3) - 11 freq dreip (3) - 2 freq greer (3) - 6 freq deary (3) - 4 freq dorr (3) - 43 freq dreamer (3) - 2 freq dreid (3) - 51 freq doar (3) - 29 freq |
SoundEx code - D660 dreary - 13 freq drawer - 132 freq dryer - 5 freq drear - 10 freq dearer - 8 freq draaer - 2 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 draer - 1 freq |
MetaPhone code - TRR terrier - 13 freq terror - 40 freq dreary - 13 freq drear - 10 freq dearer - 8 freq trurh - 1 freq draaer - 2 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 truiro - 1 freq draer - 1 freq |
DREAR |
| Time to execute Levenshtein function - 0.173956 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.416377 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.027191 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.074317 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.000915 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. |