| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deterioratin (0) - 1 freq deteriorates (2) - 1 freq deteriorate (2) - 1 freq determination (4) - 11 freq derogatin (4) - 1 freq interrogatin (4) - 1 freq reverberatin (4) - 1 freq decoratin (4) - 6 freq derivation (5) - 2 freq retreatin (5) - 1 freq percolatin (5) - 1 freq deprivation (5) - 11 freq desertin (5) - 2 freq desecration (5) - 2 freq deliberatin (5) - 1 freq leeberatin (5) - 1 freq devistatin (5) - 1 freq reinvigoratin (5) - 1 freq alternatin (5) - 1 freq peterkeating (5) - 1 freq ameliorating (5) - 1 freq eemitatin (5) - 1 freq derriakin (5) - 74 freq delegatin (5) - 1 freq demonstratin (5) - 5 freq |
deterioratin (0) - 1 freq deteriorate (3) - 1 freq deteriorates (3) - 1 freq interrogatin (6) - 1 freq decoratin (6) - 6 freq determination (6) - 11 freq derogatin (6) - 1 freq detectin (7) - 1 freq derriakin (7) - 74 freq decoration (7) - 4 freq terracin (7) - 2 freq deportin (7) - 1 freq terrain (7) - 10 freq alternatin (7) - 1 freq integratin (7) - 2 freq interrogation (7) - 1 freq deliberatin (7) - 1 freq interpretin (7) - 3 freq deprivation (7) - 11 freq retreatin (7) - 1 freq derivation (7) - 2 freq reverberatin (7) - 1 freq desertin (7) - 2 freq desecration (7) - 2 freq durritin (7) - 1 freq |
SoundEx code - D366 deterioratin - 1 freq deteriorate - 1 freq deteriorates - 1 freq |
MetaPhone code - TTRRTN deterioratin - 1 freq |
DETERIORATIN |
| Time to execute Levenshtein function - 0.251575 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.409920 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.033510 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.037177 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. |