| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kists (0) - 31 freq kjists (1) - 1 freq kist (1) - 117 freq mists (1) - 8 freq kist' (1) - 5 freq kilts (1) - 15 freq dists (1) - 1 freq kests (1) - 2 freq lists (1) - 18 freq kiss (1) - 123 freq kist's (1) - 1 freq fists (1) - 21 freq kits (1) - 4 freq 'kist (2) - 1 freq kjist (2) - 1 freq birts (2) - 1 freq wits (2) - 36 freq i'ts (2) - 2 freq exists (2) - 45 freq ist (2) - 11 freq bi'ts (2) - 1 freq kilos (2) - 1 freq 'its (2) - 8 freq kilt' (2) - 1 freq kies (2) - 1 freq |
kists (0) - 31 freq kests (1) - 2 freq kiss (2) - 123 freq fists (2) - 21 freq kits (2) - 4 freq kisties (2) - 8 freq kjists (2) - 1 freq lists (2) - 18 freq kist's (2) - 1 freq dists (2) - 1 freq kist (2) - 117 freq kist' (2) - 5 freq mists (2) - 8 freq kilts (2) - 15 freq hysts (3) - 1 freq costs (3) - 46 freq gests (3) - 2 freq mistys (3) - 2 freq biests (3) - 1 freq kistin (3) - 3 freq vests (3) - 4 freq kost (3) - 1 freq beists (3) - 2 freq pests (3) - 2 freq jeists (3) - 3 freq |
SoundEx code - K232 kist's - 1 freq kists - 31 freq kejits - 1 freq kisties - 8 freq kjists - 1 freq kist-cauld - 1 freq kests - 2 freq kezdugdale - 2 freq koukkyhdz - 1 freq |
MetaPhone code - KSTS casts - 19 freq guests - 47 freq kist's - 1 freq kists - 31 freq costs - 46 freq gusts - 5 freq guest's - 3 freq casuities - 1 freq coasts - 4 freq 'costs - 1 freq gaists - 1 freq kisties - 8 freq kïsts - 1 freq guests' - 1 freq costies - 8 freq gowstie's - 1 freq kests - 2 freq gasts - 1 freq gussets - 1 freq |
KISTS |
| Time to execute Levenshtein function - 0.190216 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.366797 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.033176 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.045227 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.000903 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. |