| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kicten (0) - 1 freq kitten (1) - 6 freq inten (2) - 2 freq picter (2) - 89 freq witten (2) - 1 freq kitted (2) - 10 freq sicken (2) - 1 freq keichen (2) - 3 freq bitten (2) - 7 freq gitten (2) - 2 freq kittin (2) - 1 freq kickin (2) - 65 freq aiten (2) - 4 freq licken (2) - 3 freq pitten (2) - 207 freq fitten (2) - 22 freq kite (2) - 19 freq nitten (2) - 5 freq lichen (2) - 9 freq lichten (2) - 8 freq kilted (2) - 6 freq tichen (2) - 3 freq siccen (2) - 1 freq sitten (2) - 12 freq killen (2) - 4 freq |
kicten (0) - 1 freq kitten (2) - 6 freq kickan (3) - 2 freq kittin (3) - 1 freq keichen (3) - 3 freq kistin (3) - 3 freq kickin (3) - 65 freq kisteen (3) - 1 freq kilter (4) - 4 freq kicked (4) - 63 freq kites (4) - 6 freq kickoan (4) - 1 freq actin (4) - 58 freq kittln (4) - 1 freq kittlen (4) - 1 freq ktn (4) - 1 freq pinten (4) - 1 freq kittens (4) - 7 freq tichten (4) - 3 freq kizzen (4) - 10 freq ectin (4) - 1 freq keichin (4) - 1 freq keaton (4) - 1 freq actan (4) - 3 freq kychin (4) - 1 freq |
SoundEx code - K235 kistin - 3 freq keystane - 3 freq kie-stane - 3 freq kicten - 1 freq kisteen - 1 freq kestin - 2 freq |
MetaPhone code - KKTN gcttin - 1 freq kicten - 1 freq |
KICTEN |
| Time to execute Levenshtein function - 0.201985 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.395982 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.027507 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.038503 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.001005 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. |