| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kythin (0) - 33 freq kythins (1) - 1 freq kythit (1) - 25 freq kychin (1) - 1 freq kyth't (2) - 1 freq nuthin (2) - 65 freq dyshin (2) - 1 freq omythin (2) - 1 freq ithin (2) - 124 freq kyths (2) - 5 freq ythan (2) - 6 freq skytin (2) - 15 freq gathin (2) - 2 freq anythin (2) - 138 freq a'thin (2) - 2 freq ketchin (2) - 1 freq nathin (2) - 6 freq onythin (2) - 498 freq python (2) - 1 freq awthin (2) - 133 freq kyth (2) - 3 freq neythin (2) - 1 freq enythin (2) - 1 freq scythin (2) - 2 freq vrythin (2) - 1 freq |
kythin (0) - 33 freq kithan (2) - 1 freq kychin (2) - 1 freq keethin (2) - 1 freq kythit (2) - 25 freq kythins (2) - 1 freq kythe (3) - 65 freq kitlin (3) - 4 freq 'ithin (3) - 2 freq thin (3) - 317 freq wthin (3) - 1 freq within (3) - 185 freq athin (3) - 226 freq kittin (3) - 1 freq kitthin (3) - 1 freq nothin (3) - 174 freq bathin (3) - 11 freq kathie (3) - 2 freq kytht (3) - 3 freq aathin (3) - 203 freq kythed (3) - 95 freq gethin (3) - 1 freq kitchin (3) - 2 freq kythes (3) - 64 freq nithin (3) - 71 freq |
SoundEx code - K350 kiddin - 70 freq kid-on - 8 freq kiddin' - 1 freq kythin - 33 freq kidney - 10 freq kithan - 1 freq kith-en - 3 freq keethin - 1 freq kitthin - 1 freq khatoon - 1 freq kitten - 5 freq kittin - 1 freq keaton - 1 freq kiddie-on - 1 freq kiddie-on-ay - 1 freq ku-to-yen - 1 freq ktn - 1 freq katm - 1 freq kttm - 1 freq kiddin - 1 freq |
MetaPhone code - K0N kythin - 33 freq kithan - 1 freq gathin - 2 freq kith-en - 3 freq keethin - 1 freq |
KYTHIN |
| Time to execute Levenshtein function - 0.198380 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.328699 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.027868 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.036612 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.000783 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. |