Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
kstew (0) - 1 freq stew (1) - 45 freq staw (2) - 10 freq kteu (2) - 2 freq slew (2) - 2 freq htew (2) - 1 freq kate (2) - 176 freq watew (2) - 2 freq kite (2) - 19 freq step (2) - 250 freq aster (2) - 1 freq ste (2) - 41 freq kites (2) - 6 freq kytes (2) - 2 freq tew (2) - 1 freq kyte (2) - 15 freq aste (2) - 1 freq knew (2) - 218 freq ster (2) - 3 freq stem (2) - 18 freq kte (2) - 1 freq askew (2) - 2 freq kisted (2) - 1 freq shew (2) - 32 freq steh (2) - 1 freq |
kstew (0) - 1 freq stew (2) - 45 freq styew (3) - 5 freq kisted (3) - 1 freq stewy (3) - 4 freq stw (3) - 43 freq stow (3) - 7 freq i'stew (3) - 1 freq staw (3) - 10 freq kost (4) - 1 freq instaw (4) - 1 freq -ster (4) - 1 freq stee (4) - 1 freq spew (4) - 21 freq sew (4) - 9 freq kistit (4) - 6 freq stey (4) - 170 freq 'stey (4) - 2 freq kestin (4) - 2 freq stwy (4) - 1 freq kistie (4) - 14 freq kisties (4) - 8 freq stewie (4) - 4 freq kistin (4) - 3 freq kists (4) - 31 freq |
SoundEx code - K300 kyte - 15 freq kythe - 65 freq kid - 103 freq kit - 30 freq kow-tow - 1 freq kate - 176 freq kith - 13 freq kiddie - 1 freq kathie - 2 freq kwite - 1 freq kite - 19 freq kathy - 4 freq keith - 15 freq kithy - 2 freq kitth - 1 freq kid' - 2 freq katie - 34 freq kïsst - 2 freq kïst - 1 freq kat - 156 freq 'kat - 3 freq kat' - 1 freq keyed - 4 freq 'kate - 1 freq kood - 5 freq kott - 1 freq ket - 1 freq kudu - 1 freq kyth - 3 freq kywte - 1 freq katy - 18 freq kidd - 7 freq key'd - 1 freq kd - 2 freq kitty - 13 freq katt - 1 freq kittie - 3 freq €˜kssst - 1 freq €˜katie - 3 freq €˜kat - 2 freq kath - 3 freq keit - 1 freq kydd - 1 freq koda - 2 freq kita - 1 freq kad - 1 freq kiddy - 1 freq kt - 3 freq kd- - 1 freq kwitie - 11 freq ‘keyed - 1 freq kaat - 1 freq kdu - 1 freq kwaaet - 1 freq kdy - 1 freq kedy - 1 freq kdyhu - 1 freq kteu - 2 freq kweyad - 1 freq kgd - 2 freq kte - 1 freq kjkcyd - 1 freq kstew - 1 freq kiddo - 1 freq |
MetaPhone code - KST kissed - 66 freq kist - 116 freq cast - 226 freq 'kist - 1 freq kistie - 14 freq coast - 115 freq caused - 78 freq guessed - 31 freq kisst - 6 freq gast - 5 freq cost - 113 freq gust - 17 freq cuist - 14 freq gazed - 15 freq gowstie - 6 freq guest - 42 freq gazette - 3 freq kest - 18 freq cassidy - 4 freq keest - 3 freq cassette - 3 freq costa - 7 freq quest - 18 freq goustie - 4 freq 'goustie - 1 freq caist - 4 freq guisit - 1 freq causit - 3 freq gceid - 1 freq gassed - 3 freq gcid - 4 freq goast - 1 freq casset - 2 freq gowsty - 5 freq 'c'est - 1 freq caste - 2 freq cassat - 1 freq 'cost - 1 freq keistie - 1 freq caased - 6 freq guesst - 5 freq csd - 11 freq quayside - 3 freq kïsst - 2 freq kïst - 1 freq cosset - 1 freq gusto - 6 freq cöst - 3 freq c'est - 1 freq kist' - 5 freq coist - 4 freq cüst - 2 freq gaist - 2 freq kist'' - 1 freq kost - 1 freq costo - 1 freq coost - 1 freq cosst - 1 freq gussied - 1 freq gustie - 3 freq coasta - 1 freq €˜kist - 1 freq €œkist - 2 freq gusset - 1 freq cousteau - 1 freq €˜kssst - 1 freq gusd - 1 freq goest - 1 freq coste - 1 freq kis't - 1 freq quizzed - 1 freq costie - 1 freq qzd - 1 freq qzitw - 1 freq 'cast' - 1 freq qzt - 1 freq gzet - 1 freq kstew - 1 freq yxd - 1 freq |
KSTEW |
Time to execute Levenshtein function - 0.515414 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.537106 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.056270 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.039839 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.000993 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. |