| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iogjkota (0) - 1 freq dakota (4) - 1 freq gota (4) - 3 freq jojoba (4) - 1 freq iota (4) - 2 freq toyota (4) - 1 freq oota (4) - 54 freq iooth (4) - 1 freq dogscott (4) - 1 freq poackit (5) - 2 freq poot (5) - 6 freq cooda (5) - 3 freq maggot (5) - 2 freq rogjnfx (5) - 1 freq bogton (5) - 1 freq zkots (5) - 4 freq tookna (5) - 1 freq mous-oa (5) - 1 freq gjo (5) - 2 freq poackets (5) - 8 freq itzjo (5) - 1 freq joukit (5) - 16 freq xokoj (5) - 1 freq moka (5) - 1 freq lookoot (5) - 1 freq |
iogjkota (0) - 1 freq jkt (6) - 1 freq ajjkt (6) - 1 freq joukt (6) - 6 freq joukit (6) - 16 freq gjit (6) - 2 freq gowkit (6) - 6 freq jokit (6) - 8 freq jookit (6) - 3 freq gota (6) - 3 freq dakota (6) - 1 freq pockit (7) - 1 freq worket (7) - 3 freq pokkit (7) - 1 freq cowkit (7) - 1 freq oobject (7) - 1 freq jot (7) - 13 freq loackt (7) - 2 freq mockit (7) - 11 freq gawkt (7) - 1 freq cookit (7) - 3 freq gallta (7) - 1 freq howkit (7) - 29 freq invokit (7) - 3 freq poukit (7) - 7 freq |
SoundEx code - I230 iced - 14 freq izzat - 2 freq is-'the - 1 freq ight - 1 freq is't - 47 freq 'is't - 1 freq iste - 1 freq i-ight - 1 freq ist - 11 freq iiokket - 1 freq iikit - 1 freq izat - 1 freq issued - 6 freq is-the - 1 freq ict - 1 freq i'stew - 1 freq i'cat - 1 freq i'settee - 1 freq i'shade - 5 freq iside - 1 freq izatt - 2 freq ischewed - 1 freq €™ist - 2 freq isit - 1 freq issit - 1 freq izzata - 1 freq ixd - 1 freq izt - 1 freq isd - 1 freq iogjkota - 1 freq iscot - 1 freq isaidaye - 2 freq ikcd - 1 freq |
MetaPhone code - IKJKT iogjkota - 1 freq |
IOGJKOTA |
| Time to execute Levenshtein function - 0.597378 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.523932 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.037292 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.066169 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.000868 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. |