| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deluded (0) - 1 freq delude (1) - 1 freq deludey (1) - 1 freq fluded (2) - 1 freq deludin (2) - 1 freq decided (2) - 210 freq deludedly (2) - 1 freq elided (2) - 1 freq dauded (2) - 1 freq beluved (2) - 1 freq desyded (2) - 2 freq delved (2) - 2 freq deleted (2) - 4 freq melded (2) - 1 freq exuded (2) - 2 freq velued (2) - 2 freq deduced (2) - 1 freq welded (2) - 1 freq deludit (2) - 1 freq diluted (2) - 5 freq decoded (2) - 1 freq eludes (2) - 1 freq secluded (2) - 1 freq delled (2) - 2 freq gelded (2) - 1 freq |
deluded (0) - 1 freq deludey (2) - 1 freq delude (2) - 1 freq deludit (3) - 1 freq welded (3) - 1 freq diluted (3) - 5 freq delled (3) - 2 freq delayed (3) - 4 freq gelded (3) - 1 freq melded (3) - 1 freq decoded (3) - 1 freq deleted (3) - 4 freq deludedly (3) - 1 freq decided (3) - 210 freq deludin (3) - 1 freq fluded (3) - 1 freq elided (3) - 1 freq dauded (3) - 1 freq desyded (3) - 2 freq delved (3) - 2 freq relaided (4) - 1 freq dolder (4) - 1 freq divyded (4) - 1 freq falded (4) - 1 freq laded (4) - 1 freq |
SoundEx code - D433 delytit - 3 freq delitit - 3 freq deleted - 4 freq dilated - 1 freq diluted - 5 freq delytit-like - 1 freq deluded - 1 freq deletit - 3 freq €˜diluted - 1 freq deludedly - 1 freq deludit - 1 freq dollydaydream - 6 freq |
MetaPhone code - TLTT tiltit - 7 freq delytit - 3 freq delitit - 3 freq tilted - 5 freq deleted - 4 freq dilated - 1 freq diluted - 5 freq tiltet - 1 freq deluded - 1 freq tltit - 1 freq deletit - 3 freq €˜diluted - 1 freq deludit - 1 freq |
DELUDED |
| Time to execute Levenshtein function - 0.209166 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.395153 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.029520 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.037705 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.000893 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. |