| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deteriorate (0) - 1 freq deteriorates (1) - 1 freq deterioratin (2) - 1 freq determinate (3) - 1 freq directorate (4) - 3 freq ameliorate (4) - 1 freq decorate (4) - 5 freq deleiberate (4) - 3 freq denigrate (4) - 2 freq meteorite (4) - 2 freq desecrate (4) - 1 freq degenerate (4) - 6 freq interrogate (4) - 1 freq electorate (4) - 18 freq deleeberate (4) - 3 freq delegate (5) - 3 freq interrogat (5) - 2 freq intricate (5) - 13 freq dedicate (5) - 8 freq deleirit (5) - 1 freq interrogated (5) - 2 freq lettermore (5) - 1 freq incorporate (5) - 1 freq determine (5) - 3 freq deprivat (5) - 1 freq |
deteriorate (0) - 1 freq deteriorates (2) - 1 freq deterioratin (3) - 1 freq determinate (5) - 1 freq interrogate (6) - 1 freq deleeberate (6) - 3 freq degenerate (6) - 6 freq deterred (6) - 3 freq desecrate (6) - 1 freq deterrent (6) - 3 freq detroit (6) - 21 freq decorate (6) - 5 freq meteorite (6) - 2 freq deleiberate (6) - 3 freq denigrate (6) - 2 freq leeterate (7) - 9 freq efterairt (7) - 1 freq dexterity (7) - 1 freq decoratet (7) - 2 freq leiterate (7) - 1 freq anterior (7) - 1 freq determinit (7) - 1 freq detergent (7) - 1 freq interior (7) - 11 freq inferiority (7) - 5 freq |
SoundEx code - D366 deterioratin - 1 freq deteriorate - 1 freq deteriorates - 1 freq |
MetaPhone code - TTRRT deteriorate - 1 freq |
DETERIORATE |
| Time to execute Levenshtein function - 0.242208 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.420738 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.030451 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.039211 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.000830 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. |