Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
iikane (0) - 1 freq ilkane (1) - 51 freq ilkae (2) - 4 freq i'lane (2) - 1 freq ilk-ane (2) - 1 freq vikabe (2) - 1 freq fikeane (2) - 1 freq pikan (2) - 2 freq insane (2) - 8 freq iika (2) - 1 freq inane (2) - 2 freq ilk'ane (2) - 6 freq diane (2) - 9 freq i'kine (2) - 1 freq kane (2) - 31 freq rane (3) - 3 freq ridan (3) - 1 freq giean (3) - 4 freq makan (3) - 21 freq whane (3) - 3 freq iphone (3) - 7 freq finance (3) - 14 freq kake (3) - 1 freq 'kate (3) - 1 freq nane (3) - 547 freq |
iikane (0) - 1 freq ilkane (2) - 51 freq kane (2) - 31 freq kine (3) - 101 freq kan (3) - 28 freq i'kine (3) - 1 freq ikon (3) - 1 freq eikin (3) - 29 freq kyne (3) - 11 freq kiyan (3) - 1 freq diane (3) - 9 freq kian (3) - 1 freq kano (3) - 1 freq aiken (3) - 11 freq pikan (3) - 2 freq kene (3) - 1 freq iika (3) - 1 freq inane (3) - 2 freq fikeane (3) - 1 freq houane (4) - 5 freq wiken (4) - 1 freq irnae (4) - 23 freq winae (4) - 2 freq iukyze (4) - 1 freq unkan (4) - 22 freq |
SoundEx code - I250 isnae - 558 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.294575 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.583773 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.027683 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.063486 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.000924 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. |