| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drier (0) - 9 freq brier (1) - 5 freq driver (1) - 92 freq drien (1) - 1 freq frier (1) - 1 freq dries (1) - 8 freq crier (1) - 2 freq driet (1) - 2 freq dryer (1) - 5 freq dried (1) - 74 freq trie (2) - 2 freq draver (2) - 2 freq drear (2) - 10 freq frien (2) - 61 freq rider (2) - 10 freq rer (2) - 3 freq ier (2) - 1 freq die' (2) - 1 freq drite (2) - 1 freq daies (2) - 2 freq deir (2) - 7 freq gier (2) - 2 freq dramer (2) - 2 freq diver (2) - 5 freq fryer (2) - 3 freq |
drier (0) - 9 freq dryer (1) - 5 freq dried (2) - 74 freq drear (2) - 10 freq drar (2) - 1 freq draar (2) - 6 freq durer (2) - 1 freq draaer (2) - 2 freq driver (2) - 92 freq drien (2) - 1 freq brier (2) - 5 freq dries (2) - 8 freq driet (2) - 2 freq frier (2) - 1 freq crier (2) - 2 freq dryen (3) - 1 freq darker (3) - 9 freq dorie (3) - 1 freq truer (3) - 5 freq dreed (3) - 13 freq drainer (3) - 2 freq doer (3) - 1 freq dryed (3) - 4 freq dater (3) - 1 freq friar (3) - 1 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 |
DRIER |
| Time to execute Levenshtein function - 0.214421 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.392192 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.027193 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.036997 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.000910 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. |