Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
iikane (0) - 1 freq ilkane (1) - 51 freq pikan (2) - 2 freq fikeane (2) - 1 freq insane (2) - 8 freq inane (2) - 2 freq i'kine (2) - 1 freq i'lane (2) - 1 freq ilkae (2) - 4 freq diane (2) - 9 freq iika (2) - 1 freq vikabe (2) - 1 freq ilk-ane (2) - 1 freq ilk'ane (2) - 6 freq kane (2) - 31 freq begane (3) - 1 freq yiase (3) - 1 freq plane (3) - 68 freq jinkan (3) - 1 freq laikan (3) - 1 freq 'plane (3) - 1 freq likins (3) - 1 freq alane (3) - 267 freq cane (3) - 22 freq giant (3) - 84 freq |
iikane (0) - 1 freq ilkane (2) - 51 freq kane (2) - 31 freq kiyan (3) - 1 freq kano (3) - 1 freq ikon (3) - 1 freq kine (3) - 101 freq kyne (3) - 10 freq kian (3) - 1 freq kene (3) - 1 freq aiken (3) - 11 freq kan (3) - 28 freq i'kine (3) - 1 freq fikeane (3) - 1 freq eikin (3) - 29 freq pikan (3) - 2 freq inane (3) - 2 freq iika (3) - 1 freq diane (3) - 9 freq giean (4) - 4 freq wakan (4) - 1 freq eine (4) - 1 freq ane (4) - 2115 freq makan (4) - 21 freq knei (4) - 1 freq |
SoundEx code - I250 isnae - 544 freq icin - 10 freq isna - 390 freq ikon - 1 freq icon - 10 freq izna - 3 freq isn' - 2 freq issin - 1 freq icam - 1 freq isno - 36 freq isn - 20 freq i'game - 6 freq i'same - 10 freq i'quine - 6 freq i'kine - 1 freq i'sun - 12 freq i'sna - 3 freq i'soon - 1 freq i'quinie - 1 freq -ikin - 1 freq ixion - 1 freq isni - 5 freq ishin - 2 freq isny - 6 freq €˜isnae - 1 freq 'isnae' - 1 freq ice-een - 1 freq €œisn - 1 freq €œisna - 1 freq iikane - 1 freq ijin - 1 freq isxcn - 1 freq iqwm - 1 freq isney - 1 freq i-con - 1 freq isnea - 1 freq |
MetaPhone code - IKN ikon - 1 freq icon - 10 freq i'quine - 6 freq i'kine - 1 freq i'quinie - 1 freq -ikin - 1 freq iikane - 1 freq i-con - 1 freq |
IIKANE |
Time to execute Levenshtein function - 0.281927 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.550428 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.027523 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.037916 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.000843 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. |