| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kyettle (0) - 1 freq khettle (1) - 1 freq kettle (1) - 82 freq ettle (2) - 188 freq kettles (2) - 2 freq kittle (2) - 43 freq settle (2) - 96 freq kettlie (2) - 3 freq fettle (2) - 23 freq nyeetle (2) - 1 freq mettle (2) - 12 freq lyttle (2) - 2 freq rettle (2) - 1 freq nettle (2) - 8 freq settled (3) - 114 freq kittlt (3) - 4 freq rettled (3) - 1 freq shottle (3) - 1 freq flettie (3) - 1 freq fettled (3) - 1 freq settee (3) - 30 freq tottle (3) - 1 freq crottle (3) - 7 freq gyettin (3) - 1 freq ettlet (3) - 8 freq |
kyettle (0) - 1 freq kettle (1) - 82 freq kittle (2) - 43 freq khettle (2) - 1 freq kettlie (2) - 3 freq lyttle (3) - 2 freq kittlie (3) - 7 freq kittly (3) - 1 freq mettle (3) - 12 freq rettle (3) - 1 freq nettle (3) - 8 freq fettle (3) - 23 freq kettles (3) - 2 freq settle (3) - 96 freq ettle (3) - 188 freq kirtle (4) - 2 freq battle (4) - 125 freq etttle (4) - 1 freq bittle (4) - 1 freq skuttle (4) - 3 freq kittles (4) - 7 freq pattle (4) - 1 freq dottle (4) - 1 freq cuittle (4) - 1 freq kjettil (4) - 3 freq |
SoundEx code - K340 kettle - 82 freq kittle - 43 freq kettlie - 3 freq ketil - 7 freq kittlie - 7 freq kittil - 9 freq kjettil - 3 freq khettle - 1 freq kyettle - 1 freq kittly - 1 freq |
MetaPhone code - KYTL kyettle - 1 freq |
KYETTLE |
| Time to execute Levenshtein function - 0.408347 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.544647 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.057943 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.043551 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.000794 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. |