| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deleerit (0) - 8 freq deleirit (1) - 1 freq deliverit (2) - 4 freq deleevirt (2) - 1 freq deleer (2) - 1 freq deleiverit (2) - 1 freq depleetit (2) - 1 freq deletit (2) - 3 freq leirit (3) - 24 freq elevkit (3) - 1 freq lerrit (3) - 2 freq sleepit (3) - 40 freq delcarin (3) - 1 freq dexterity (3) - 1 freq deseruit (3) - 1 freq reveesit (3) - 1 freq selectit (3) - 7 freq dependit (3) - 10 freq letterit (3) - 1 freq cleert (3) - 1 freq deceit (3) - 5 freq deeskit (3) - 1 freq clearit (3) - 2 freq deservit (3) - 3 freq leekit (3) - 1 freq |
deleerit (0) - 8 freq deleirit (1) - 1 freq deletit (3) - 3 freq deleer (3) - 1 freq deleiverit (3) - 1 freq deliverit (3) - 4 freq deleevirt (3) - 1 freq delitit (4) - 3 freq deleivert (4) - 6 freq clearit (4) - 2 freq delivert (4) - 10 freq bleirit (4) - 2 freq bleert (4) - 1 freq cleert (4) - 1 freq learit (4) - 3 freq decreeit (4) - 1 freq deleerious (4) - 1 freq desirit (4) - 3 freq delvit (4) - 1 freq desert (4) - 60 freq doverit (4) - 1 freq deleteart (4) - 1 freq leirit (4) - 24 freq depleetit (4) - 1 freq deseruit (4) - 1 freq |
SoundEx code - D463 deleerit - 8 freq dalriada - 8 freq deilward - 1 freq deleirit - 1 freq dalyrd - 1 freq |
MetaPhone code - TLRT deleerit - 8 freq dalriada - 8 freq tolerate - 7 freq tailored - 3 freq deleirit - 1 freq €˜tolerate - 1 freq ‘tolerateÂ’ - 1 freq dalyrd - 1 freq |
DELEERIT |
| Time to execute Levenshtein function - 0.233909 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.372846 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.027998 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.039914 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.001179 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. |