| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deleerious (0) - 1 freq deleecious (1) - 1 freq delirious (2) - 3 freq releegious (2) - 24 freq deleicious (2) - 1 freq deceesions (3) - 10 freq deveesions (3) - 1 freq releigious (3) - 8 freq obleevious (3) - 1 freq dexterous (3) - 1 freq maleecious (3) - 1 freq deleevries (3) - 1 freq keerious (3) - 3 freq releegions (3) - 3 freq delicious (3) - 24 freq deleerit (3) - 8 freq releegion (4) - 18 freq rebellious (4) - 4 freq imperious (4) - 4 freq devious (4) - 4 freq elections (4) - 47 freq deleeveries (4) - 1 freq deceesion (4) - 13 freq denarius (4) - 1 freq deliveries (4) - 4 freq |
deleerious (0) - 1 freq delirious (2) - 3 freq deleecious (2) - 1 freq deleicious (3) - 1 freq delicious (4) - 24 freq releegious (4) - 24 freq deleevries (4) - 1 freq deleerit (4) - 8 freq denarius (5) - 1 freq desirous (5) - 1 freq deliveries (5) - 4 freq glorious (5) - 58 freq adulterous (5) - 1 freq deleirit (5) - 1 freq hilarious (5) - 18 freq delirium (5) - 3 freq deleeveries (5) - 1 freq leeries (5) - 6 freq deleer (5) - 1 freq decorous (5) - 2 freq maleecious (5) - 1 freq dexterous (5) - 1 freq obleevious (5) - 1 freq keerious (5) - 3 freq dealers (5) - 10 freq |
SoundEx code - D462 deleerious - 1 freq dwallers - 3 freq dailers - 2 freq dealers - 10 freq dollars - 6 freq delirious - 3 freq dollarglen - 1 freq dollars- - 1 freq |
MetaPhone code - TLRS tellers - 5 freq deleerious - 1 freq tellaris - 1 freq dailers - 2 freq tellures - 1 freq dealers - 10 freq dollars - 6 freq delirious - 3 freq tailors - 7 freq teylers - 1 freq taylors - 1 freq tailor's - 1 freq dollars- - 1 freq tylers - 1 freq tailrace - 1 freq |
DELEERIOUS |
| Time to execute Levenshtein function - 0.262688 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.429084 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.037848 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.051023 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.000861 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. |