| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knitted (0) - 13 freq knittet (1) - 2 freq knotted (1) - 8 freq knitter (1) - 2 freq kitted (1) - 10 freq nittet (2) - 1 freq knittin (2) - 26 freq kisted (2) - 1 freq knighted (2) - 2 freq knittan (2) - 3 freq flitted (2) - 30 freq nitten (2) - 5 freq gritted (2) - 3 freq knittit (2) - 7 freq kniped (2) - 1 freq k'nitter (2) - 1 freq knottied (2) - 1 freq fitted (2) - 27 freq knidged (2) - 1 freq kilted (2) - 6 freq knitters (2) - 1 freq snitter (2) - 1 freq emitted (2) - 2 freq united (2) - 75 freq knifed (2) - 1 freq |
knitted (0) - 13 freq knotted (1) - 8 freq knottied (2) - 1 freq kitted (2) - 10 freq knittet (2) - 2 freq knitter (2) - 2 freq knittit (3) - 7 freq knitteen (3) - 5 freq knittan (3) - 3 freq notted (3) - 1 freq knittin (3) - 26 freq pitted (4) - 1 freq kitten (4) - 5 freq nitter (4) - 1 freq knifed (4) - 1 freq smitted (4) - 1 freq knott (4) - 6 freq knottit (4) - 6 freq knottin (4) - 1 freq nittet (4) - 1 freq flitted (4) - 30 freq united (4) - 75 freq kittled (4) - 24 freq emitted (4) - 2 freq k'nitter (4) - 1 freq |
SoundEx code - K533 knottit - 6 freq knittit - 7 freq knitted - 13 freq knittet - 2 freq knotted - 8 freq k'nittit - 1 freq knottied - 1 freq kent-it-na - 1 freq kennedydalby - 1 freq kennethwatt - 1 freq knittedkittie - 1 freq |
MetaPhone code - NTT noddit - 122 freq needit - 167 freq nodded - 70 freq noted - 23 freq knottit - 6 freq needed - 143 freq needty - 1 freq notit - 12 freq knittit - 7 freq knitted - 13 freq neidit - 1 freq noadded - 2 freq needet - 2 freq noddet - 1 freq knittet - 2 freq knotted - 8 freq notted - 1 freq nottit - 3 freq knottied - 1 freq neded - 3 freq €™nittit - 1 freq nedeit - 1 freq nittet - 1 freq notid - 1 freq needid - 1 freq |
KNITTED |
| Time to execute Levenshtein function - 0.189220 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.348360 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.028029 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.040527 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.000997 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. |