| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kitted (0) - 10 freq knitted (1) - 13 freq fitted (1) - 27 freq kittled (1) - 24 freq pitted (1) - 1 freq kisted (1) - 1 freq kitten (1) - 5 freq kilted (1) - 6 freq emitted (2) - 2 freq pitied (2) - 3 freq kerted (2) - 1 freq nitter (2) - 1 freq hinted (2) - 2 freq witter (2) - 10 freq flitted (2) - 30 freq patted (2) - 14 freq kittie (2) - 3 freq misted (2) - 2 freq airted (2) - 31 freq gitter (2) - 1 freq skirted (2) - 2 freq killed (2) - 81 freq kittil (2) - 9 freq pitten (2) - 206 freq kittlt (2) - 4 freq |
kitted (0) - 10 freq kitten (2) - 5 freq kilted (2) - 6 freq pitted (2) - 1 freq kisted (2) - 1 freq knitted (2) - 13 freq fitted (2) - 27 freq kittled (2) - 24 freq kittyb (3) - 1 freq kittin (3) - 1 freq kittit (3) - 2 freq matted (3) - 2 freq notted (3) - 1 freq kitty (3) - 13 freq rotted (3) - 1 freq hatted (3) - 1 freq fittid (3) - 1 freq kittle (3) - 43 freq kitth (3) - 1 freq hutted (3) - 1 freq petted (3) - 2 freq batted (3) - 1 freq rutted (3) - 1 freq butted (3) - 5 freq kittly (3) - 1 freq |
SoundEx code - K330 kythed - 95 freq kiddit - 1 freq kythit - 25 freq kittit - 2 freq kiddet - 3 freq kitted - 10 freq kytht - 3 freq kyth't - 1 freq kidded - 1 freq ktid - 1 freq |
MetaPhone code - KTT cat'd - 1 freq gutted - 32 freq cuttit - 21 freq guidit - 17 freq quoted - 8 freq kiddit - 1 freq quotit - 11 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq cuddied - 1 freq quieted - 1 freq coatit - 4 freq coated - 4 freq kittit - 2 freq coatet - 3 freq kiddet - 3 freq cadet - 2 freq kitted - 10 freq quietude - 1 freq quottit - 1 freq gated - 1 freq quited - 1 freq caaed-oot - 1 freq goaded - 1 freq godot - 1 freq coded - 2 freq €™guided - 1 freq gtid - 1 freq kidded - 1 freq ctodd - 1 freq ktid - 1 freq |
KITTED |
| Time to execute Levenshtein function - 0.224919 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.329272 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.027551 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.036898 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.000774 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. |