| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kestin (0) - 2 freq jestin (1) - 1 freq nestin (1) - 3 freq lestin (1) - 2 freq testin (1) - 15 freq kistin (1) - 3 freq restin (1) - 31 freq festing (2) - 1 freq mertin (2) - 2 freq tastin (2) - 13 freq questin (2) - 11 freq settin (2) - 144 freq kittin (2) - 1 freq meltin (2) - 24 freq postin (2) - 21 freq oustin (2) - 1 freq feastin (2) - 17 freq listin (2) - 4 freq jeestin (2) - 1 freq nestis (2) - 1 freq kesson (2) - 2 freq keethin (2) - 1 freq skeetin (2) - 1 freq restis (2) - 1 freq hentin (2) - 4 freq |
kestin (0) - 2 freq kistin (1) - 3 freq testin (2) - 15 freq restin (2) - 31 freq lestin (2) - 2 freq jestin (2) - 1 freq nestin (2) - 3 freq fistin (3) - 1 freq wystin (3) - 2 freq tistin (3) - 1 freq pastin (3) - 2 freq weston (3) - 7 freq keistie (3) - 1 freq kissin (3) - 24 freq kests (3) - 2 freq kertan (3) - 1 freq sestina (3) - 2 freq ristin (3) - 3 freq kisteen (3) - 1 freq tostin (3) - 1 freq justin (3) - 6 freq rustin (3) - 5 freq wastin (3) - 32 freq dustin (3) - 12 freq reistin (3) - 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 - KSTN quaisten - 23 freq questin - 11 freq cusdnae - 1 freq castin - 48 freq gustin - 1 freq costin - 5 freq kistin - 3 freq gawston - 25 freq coastin - 1 freq caistin - 1 freq cuisten - 2 freq costin' - 1 freq keystane - 3 freq costan - 1 freq kie-stane - 3 freq castan - 1 freq kisteen - 1 freq casten - 2 freq gawstoun - 3 freq kestin - 2 freq €˜quaisten - 1 freq cuistin - 3 freq quaisteen - 1 freq gosden - 1 freq quaesten - 2 freq |
KESTIN |
| Time to execute Levenshtein function - 0.350904 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.385119 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.030968 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.046615 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.000865 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. |