| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deludit (0) - 1 freq deludin (1) - 1 freq beluvit (2) - 7 freq desydit (2) - 1 freq fludit (2) - 1 freq delvit (2) - 1 freq deludey (2) - 1 freq decodit (2) - 1 freq deletit (2) - 3 freq decidit (2) - 104 freq deluded (2) - 1 freq delytit (2) - 3 freq alludit (2) - 2 freq daudit (2) - 2 freq delitit (2) - 3 freq delude (2) - 1 freq includit (3) - 57 freq beukit (3) - 3 freq dividit (3) - 7 freq beddit (3) - 16 freq occludit (3) - 1 freq leukit (3) - 305 freq delphi (3) - 1 freq delite (3) - 4 freq audit (3) - 12 freq |
deludit (0) - 1 freq deludin (2) - 1 freq alludit (3) - 2 freq daudit (3) - 2 freq deluded (3) - 1 freq delude (3) - 1 freq decidit (3) - 104 freq delitit (3) - 3 freq delytit (3) - 3 freq desydit (3) - 1 freq deletit (3) - 3 freq fludit (3) - 1 freq delvit (3) - 1 freq decodit (3) - 1 freq deludey (3) - 1 freq fluidit (4) - 3 freq delyt (4) - 3 freq fleudit (4) - 2 freq foldit (4) - 12 freq decidet (4) - 23 freq bieldit (4) - 6 freq eildit (4) - 12 freq ledit (4) - 1 freq dirdit (4) - 5 freq ladit (4) - 2 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 |
DELUDIT |
| Time to execute Levenshtein function - 0.189199 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.349764 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.027185 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.037557 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.000907 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. |