| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| delineating (0) - 1 freq deliberatin (3) - 1 freq dominating (3) - 1 freq delivering (3) - 2 freq deliverin (4) - 15 freq believing (4) - 2 freq defecting (4) - 2 freq debating (4) - 4 freq delegatin (4) - 1 freq devistatin (4) - 1 freq delichtin (4) - 2 freq deliverin' (4) - 11 freq seed-eating (4) - 1 freq obliterating (4) - 2 freq declining (4) - 2 freq releasing (4) - 2 freq dictating (4) - 1 freq deflecting (4) - 1 freq devastating (4) - 2 freq dominatin (4) - 6 freq dedicatin (4) - 2 freq relating (4) - 1 freq repeating (4) - 2 freq defineetion (4) - 9 freq legislating (4) - 1 freq |
delineating (0) - 1 freq dominating (4) - 1 freq denoting (5) - 1 freq delting (5) - 2 freq donating (5) - 2 freq delivering (5) - 2 freq defineetions (6) - 1 freq delaying (6) - 1 freq planting (6) - 1 freq defineetion (6) - 9 freq ameliorating (6) - 1 freq debilitating (6) - 1 freq defineition (6) - 2 freq defining (6) - 3 freq daunting (6) - 1 freq diverting (6) - 1 freq deliberatin (6) - 1 freq emanating (6) - 3 freq relating (6) - 1 freq diluting (6) - 2 freq declining (6) - 2 freq defecting (6) - 2 freq debating (6) - 4 freq delegatin (6) - 1 freq deflecting (6) - 1 freq |
SoundEx code - D453 delineating - 1 freq dalmatians - 4 freq dalmatian - 1 freq doolander - 1 freq dalmations - 3 freq dalnoid - 6 freq dolomites - 1 freq |
MetaPhone code - TLNTNK delineating - 1 freq |
DELINEATING |
| Time to execute Levenshtein function - 0.366882 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.813658 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.080739 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.039082 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.000849 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. |