| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| icin (0) - 10 freq iyin (1) - 1 freq 'cin (1) - 1 freq gicin (1) - 1 freq iain (1) - 49 freq icon (1) - 10 freq icing (1) - 8 freq iin (1) - 2 freq ijin (1) - 1 freq cin (1) - 289 freq ilin (1) - 1 freq ici (1) - 2 freq icic (1) - 1 freq fain (2) - 44 freq tin (2) - 180 freq itif (2) - 1 freq awin (2) - 5 freq icam (2) - 1 freq rinin (2) - 2 freq bain (2) - 77 freq tyin (2) - 12 freq main (2) - 282 freq ibis (2) - 1 freq wilin (2) - 1 freq skin (2) - 264 freq |
icin (0) - 10 freq icon (1) - 10 freq cin (1) - 289 freq cen (2) - 12 freq ecn (2) - 2 freq cn (2) - 2 freq iyin (2) - 1 freq cun (2) - 18 freq coin (2) - 46 freq can (2) - 4706 freq acan (2) - 1 freq cain (2) - 24 freq con (2) - 21 freq yican (2) - 1 freq ycn (2) - 1 freq iin (2) - 2 freq ijin (2) - 1 freq iain (2) - 49 freq gicin (2) - 1 freq 'cin (2) - 1 freq ilin (2) - 1 freq icing (2) - 8 freq cyn (2) - 1 freq icic (2) - 1 freq ici (2) - 2 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 - ISN isnae - 544 freq icin - 10 freq isna - 390 freq izna - 3 freq isn' - 2 freq issin - 1 freq isno - 36 freq isn - 20 freq i'sun - 12 freq i'sna - 3 freq i'soon - 1 freq isni - 5 freq isny - 6 freq €˜isnae - 1 freq 'isnae' - 1 freq ice-een - 1 freq €œisn - 1 freq €œisna - 1 freq isney - 1 freq isnea - 1 freq |
ICIN |
| Time to execute Levenshtein function - 0.187606 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.325213 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.029085 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.041845 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.000852 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. |