| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| isny (0) - 6 freq isna (1) - 390 freq isney (1) - 1 freq issy (1) - 1 freq inny (1) - 3 freq disny (1) - 5 freq isnt (1) - 2 freq isni (1) - 5 freq isno (1) - 36 freq isn (1) - 20 freq iny (1) - 6 freq wisny (1) - 4 freq isn' (1) - 2 freq isntb (2) - 1 freq iss- (2) - 1 freq wisn (2) - 3 freq wizny (2) - 1 freq many (2) - 362 freq iy (2) - 3 freq inky (2) - 8 freq isley (2) - 1 freq udny (2) - 9 freq imno (2) - 1 freq isd (2) - 1 freq ins (2) - 14 freq |
isny (0) - 6 freq isni (1) - 5 freq isno (1) - 36 freq isney (1) - 1 freq isna (1) - 390 freq isn (1) - 20 freq sna (2) - 167 freq sno (2) - 1 freq sony (2) - 3 freq isnea (2) - 1 freq asn (2) - 1 freq sn (2) - 1 freq isnae (2) - 544 freq wisny (2) - 4 freq disny (2) - 5 freq inny (2) - 3 freq issy (2) - 1 freq isn' (2) - 2 freq isnt (2) - 2 freq osnu (2) - 1 freq iny (2) - 6 freq isg (3) - 1 freq ise (3) - 2 freq gony (3) - 2 freq deny (3) - 52 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 |
ISNY |
| Time to execute Levenshtein function - 0.177835 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.342703 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.027472 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.037836 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.000791 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. |