| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dweller (0) - 2 freq duller (2) - 2 freq waller (2) - 1 freq welder (2) - 4 freq bueller (2) - 1 freq dueler (2) - 1 freq dealer (2) - 15 freq dwells (2) - 2 freq dwell (2) - 11 freq swelled (2) - 8 freq feller (2) - 1 freq seller (2) - 11 freq geller (2) - 1 freq keller (2) - 1 freq delled (2) - 2 freq wellen (2) - 1 freq deleer (2) - 1 freq speller (2) - 2 freq dwellin (2) - 4 freq driller (2) - 5 freq teller (2) - 1 freq heller (2) - 3 freq dwallers (2) - 3 freq jeweller (2) - 14 freq kdeller (2) - 1 freq |
dweller (0) - 2 freq dwell (3) - 11 freq jeweller (3) - 14 freq duller (3) - 2 freq dwells (3) - 2 freq dwallers (3) - 3 freq waller (3) - 1 freq driller (3) - 5 freq dwellin (3) - 4 freq kdeller (4) - 1 freq dollar (4) - 12 freq dwalls (4) - 1 freq dwall (4) - 10 freq indwaller (4) - 1 freq jewellery (4) - 30 freq dwallit (4) - 2 freq dwallin (4) - 15 freq dwallt (4) - 4 freq teller (4) - 1 freq dillier (4) - 1 freq heller (4) - 3 freq swelled (4) - 8 freq feller (4) - 1 freq dealer (4) - 15 freq dueler (4) - 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 - TWLR dweller - 2 freq |
DWELLER |
| Time to execute Levenshtein function - 0.204294 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.384658 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.028112 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.039752 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.000884 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. |