| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dealer (0) - 15 freq dealers (1) - 10 freq healer (1) - 1 freq dearer (1) - 8 freq seller (2) - 11 freq deter (2) - 4 freq feller (2) - 1 freq denser (2) - 2 freq teller (2) - 1 freq bearer (2) - 7 freq seater (2) - 1 freq deener (2) - 3 freq beaver (2) - 3 freq hearer (2) - 1 freq dener (2) - 2 freq taaler (2) - 3 freq dewer (2) - 2 freq efler (2) - 1 freq deadlier (2) - 1 freq delled (2) - 2 freq declir (2) - 1 freq deave (2) - 8 freq heater (2) - 13 freq beaker (2) - 6 freq healed (2) - 10 freq |
dealer (0) - 15 freq deleer (2) - 1 freq dueler (2) - 1 freq dearer (2) - 8 freq dealers (2) - 10 freq healer (2) - 1 freq dailer (2) - 1 freq deals (3) - 18 freq dale (3) - 29 freq daled (3) - 5 freq dialec (3) - 2 freq caaler (3) - 1 freq dales (3) - 6 freq deer (3) - 69 freq dale' (3) - 1 freq dazler (3) - 2 freq aaler (3) - 17 freq peeler (3) - 3 freq dealin (3) - 30 freq daaner (3) - 1 freq dealt (3) - 33 freq deal (3) - 190 freq deefer (3) - 1 freq dalry (3) - 3 freq dlir (3) - 1 freq |
SoundEx code - D460 dollar - 12 freq dealer - 15 freq dalry - 3 freq dillier - 1 freq duller - 2 freq dailer - 1 freq dueler - 1 freq deleer - 1 freq dweller - 2 freq dtaylor - 7 freq dlir - 1 freq |
MetaPhone code - TLR dollar - 12 freq taller - 23 freq dealer - 15 freq taylor - 17 freq tyler - 15 freq dalry - 3 freq tiller - 12 freq teller - 1 freq taaller - 1 freq taaler - 3 freq dillier - 1 freq duller - 2 freq dailer - 1 freq dueler - 1 freq tailor - 28 freq deleer - 1 freq tylor - 1 freq dlir - 1 freq tlr - 1 freq |
DEALER |
| Time to execute Levenshtein function - 0.165272 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.313444 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.043184 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.036583 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.000773 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. |