| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kistit (0) - 7 freq listit (1) - 7 freq kistit' (1) - 1 freq kiltit (1) - 4 freq histit (1) - 1 freq kittit (1) - 2 freq kistin (1) - 3 freq ristit (1) - 5 freq kistie (1) - 14 freq mistit (1) - 1 freq tiltit (2) - 7 freq airtit (2) - 42 freq hintit (2) - 2 freq hostit (2) - 7 freq tastit (2) - 29 freq eistir (2) - 1 freq fistir (2) - 1 freq laistit (2) - 2 freq risit (2) - 1 freq listet (2) - 1 freq reistit (2) - 2 freq ristin (2) - 3 freq citit (2) - 2 freq iftit (2) - 1 freq kittie (2) - 3 freq |
kistit (0) - 7 freq kistin (2) - 3 freq kistie (2) - 14 freq mistit (2) - 1 freq kittit (2) - 2 freq ristit (2) - 5 freq histit (2) - 1 freq kistit' (2) - 1 freq kiltit (2) - 4 freq listit (2) - 7 freq visitit (3) - 2 freq nestit (3) - 3 freq keistie (3) - 1 freq pastit (3) - 1 freq kisst (3) - 6 freq vestit (3) - 1 freq kist (3) - 117 freq hoistit (3) - 1 freq testit (3) - 10 freq ruistit (3) - 1 freq kisties (3) - 8 freq hystit (3) - 6 freq existit (3) - 18 freq dustit (3) - 5 freq heistit (3) - 4 freq |
SoundEx code - K233 kistit' - 1 freq kistit - 7 freq kisted - 1 freq |
MetaPhone code - KSTT custody - 13 freq costit - 3 freq kistit' - 1 freq kistit - 7 freq coasted - 1 freq castit - 1 freq kisted - 1 freq casted - 2 freq cast-oot - 1 freq wkstott - 1 freq |
KISTIT |
| Time to execute Levenshtein function - 0.187271 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.354976 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.027673 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.038989 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.001000 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. |