| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kermit (0) - 2 freq kerpit (1) - 3 freq kerrit (1) - 1 freq hermit (1) - 17 freq permit (1) - 7 freq kervit (1) - 9 freq kelpit (2) - 4 freq kennit (2) - 1 freq merit (2) - 17 freq keit (2) - 1 freq merkit (2) - 32 freq feemit (2) - 1 freq dermot (2) - 1 freq armit (2) - 4 freq nemmit (2) - 1 freq emit (2) - 4 freq wirmit (2) - 1 freq lerrit (2) - 2 freq vermin (2) - 3 freq termt (2) - 1 freq sertit (2) - 1 freq warmit (2) - 2 freq leemit (2) - 14 freq semit (2) - 1 freq kertie (2) - 2 freq |
kermit (0) - 2 freq kerpit (2) - 3 freq kervit (2) - 9 freq permit (2) - 7 freq hermit (2) - 17 freq kerrit (2) - 1 freq karmic (3) - 1 freq kirnit (3) - 1 freq termt (3) - 1 freq airmit (3) - 4 freq wirmit (3) - 1 freq warmit (3) - 2 freq formit (3) - 6 freq dermot (3) - 1 freq wormit (3) - 7 freq remit (3) - 11 freq kertie (3) - 2 freq kert (3) - 8 freq armit (3) - 4 freq herkit (4) - 1 freq kirst (4) - 6 freq mairmit (4) - 1 freq permis (4) - 1 freq kraut (4) - 1 freq keikit (4) - 9 freq |
SoundEx code - K653 ker-haundit - 1 freq kirnt - 2 freq kerrant - 1 freq kermit - 2 freq kärnten's - 1 freq kirnitten - 2 freq kirnit - 1 freq kirned - 3 freq karendunbar - 1 freq karendallas - 1 freq kieranwatters - 1 freq |
MetaPhone code - KRMT crammed - 7 freq crammt - 1 freq groomed - 3 freq crimmed - 1 freq cremate - 1 freq kermit - 2 freq curmewd - 1 freq |
KERMIT |
| Time to execute Levenshtein function - 0.217747 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.415946 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.034261 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.043445 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.000915 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. |