Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
isn (0) - 20 freq isna (1) - 390 freq in (1) - 44358 freq isg (1) - 1 freq is' (1) - 2 freq isni (1) - 5 freq iin (1) - 2 freq inn (1) - 29 freq ion (1) - 1 freq vsn (1) - 1 freq ian (1) - 202 freq is- (1) - 6 freq ien (1) - 3 freq isd (1) - 1 freq wisn (1) - 3 freq ise (1) - 2 freq itn (1) - 2 freq is (1) - 18023 freq isno (1) - 36 freq ipn (1) - 1 freq iss (1) - 480 freq msn (1) - 5 freq asn (1) - 1 freq isp (1) - 3 freq isbn (1) - 23 freq |
isn (0) - 20 freq isny (1) - 6 freq isno (1) - 36 freq asn (1) - 1 freq isna (1) - 390 freq isni (1) - 5 freq sn (1) - 1 freq sna (2) - 167 freq isnae (2) - 544 freq son (2) - 513 freq sen (2) - 155 freq imn (2) - 2 freq isnt (2) - 2 freq osnu (2) - 1 freq san (2) - 44 freq aisan (2) - 1 freq isney (2) - 1 freq uisin (2) - 105 freq usin (2) - 94 freq sno (2) - 1 freq usan (2) - 4 freq eisin (2) - 1 freq aisin (2) - 1 freq ist (2) - 11 freq syn (2) - 6 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 |
ISN |
Time to execute Levenshtein function - 0.190737 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.339712 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.027575 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.037678 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.000850 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. |