| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| isno (0) - 36 freq disno (1) - 35 freq isnt (1) - 2 freq isny (1) - 6 freq ino (1) - 2 freq isni (1) - 5 freq imno (1) - 1 freq isn' (1) - 2 freq inno (1) - 197 freq irno (1) - 1 freq wisno (1) - 19 freq isn (1) - 20 freq isna (1) - 390 freq i'no (1) - 1 freq iano (1) - 1 freq sno (1) - 1 freq disni (2) - 7 freq kso (2) - 2 freq sho (2) - 19 freq in' (2) - 13 freq isa (2) - 24 freq mano (2) - 1 freq wirno (2) - 8 freq seo (2) - 1 freq wino (2) - 2 freq |
isno (0) - 36 freq sno (1) - 1 freq isni (1) - 5 freq isn (1) - 20 freq isna (1) - 390 freq isny (1) - 6 freq sna (2) - 167 freq osnu (2) - 1 freq iano (2) - 1 freq sn (2) - 1 freq isnae (2) - 544 freq isnea (2) - 1 freq isney (2) - 1 freq asn (2) - 1 freq isn' (2) - 2 freq inno (2) - 197 freq i'no (2) - 1 freq ino (2) - 2 freq disno (2) - 35 freq isnt (2) - 2 freq irno (2) - 1 freq imno (2) - 1 freq wisno (2) - 19 freq disny (3) - 5 freq ion (3) - 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 - 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 |
ISNO |
| Time to execute Levenshtein function - 0.174884 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.305128 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.027788 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.036632 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.000797 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. |