| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zkcgiq (0) - 1 freq zkjg (3) - 1 freq kgq (3) - 1 freq cliq (3) - 1 freq cgi (3) - 3 freq zllgi (3) - 1 freq kci (3) - 1 freq zmigi (3) - 1 freq zchiz (3) - 1 freq hangit (4) - 12 freq moggie (4) - 1 freq sclim (4) - 25 freq zkdr (4) - 1 freq murgis (4) - 1 freq ruggid (4) - 2 freq bungin (4) - 3 freq nichit (4) - 1 freq zk (4) - 3 freq weegie (4) - 9 freq skeil (4) - 2 freq grigio (4) - 2 freq crib (4) - 7 freq leggis (4) - 1 freq mackin (4) - 1 freq tiggit (4) - 2 freq |
zkcgiq (0) - 1 freq kgq (5) - 1 freq zkjg (5) - 1 freq zchiz (6) - 1 freq kci (6) - 1 freq zmigi (6) - 1 freq zllgi (6) - 1 freq cliq (6) - 1 freq cgi (6) - 3 freq kingie (7) - 1 freq cgl (7) - 2 freq kzgyl (7) - 1 freq kgd (7) - 2 freq zfjq (7) - 1 freq kge (7) - 1 freq zkqx (7) - 1 freq vcgc (7) - 1 freq skuggis (7) - 1 freq tcg (7) - 1 freq zgz (7) - 1 freq kczoe (7) - 1 freq alwgq (7) - 1 freq zact (7) - 4 freq mcgog (7) - 1 freq mcg (7) - 3 freq |
SoundEx code - Z200 zis - 2 freq zouk - 1 freq zig - 6 freq zag - 7 freq zac - 4 freq 'zac' - 1 freq zak - 4 freq zowk - 1 freq zeus - 12 freq zeus's - 3 freq ziska - 1 freq zoos - 2 freq ziege - 1 freq zxkuc - 1 freq zqhos - 1 freq zqij - 1 freq zeke - 1 freq zcccyg - 1 freq zehoc - 1 freq zuaz - 1 freq zqzzejo - 1 freq zqyk - 1 freq zijc - 1 freq zys - 1 freq zzhq - 1 freq zhws - 1 freq zsuz - 1 freq zico - 1 freq zkcgiq - 1 freq zchiz - 1 freq zoioigaa - 1 freq |
MetaPhone code - SKKJK zkcgiq - 1 freq |
ZKCGIQ |
| Time to execute Levenshtein function - 0.205929 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.334270 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.028238 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.039366 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.000867 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. |