Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
isn (3) - 20 freq isnt (3) - 2 freq isn't (3) - 33 freq isnae (3) - 544 freq isn' (3) - 2 freq isntb (3) - 1 freq isnea (3) - 1 freq isney (3) - 1 freq isno (3) - 36 freq isnt' (3) - 1 freq isny (3) - 6 freq isna (3) - 390 freq isnÂ’t (3) - 2 freq isni (3) - 5 freq init (4) - 1 freq i'sna (4) - 3 freq sno (4) - 1 freq intae (4) - 4586 freq ineed (4) - 1 freq disny (4) - 5 freq int (4) - 31 freq sna (4) - 167 freq ignore (4) - 58 freq snaik (4) - 2 freq island (4) - 119 freq |
isnt' (6) - 1 freq isno (6) - 36 freq isny (6) - 6 freq isnÂ’t (6) - 2 freq isn (6) - 20 freq isni (6) - 5 freq isney (6) - 1 freq isna (6) - 390 freq isnt (6) - 2 freq isnea (6) - 1 freq isn't (6) - 33 freq isnae (6) - 544 freq isntb (6) - 1 freq isn' (6) - 2 freq snab (7) - 1 freq snob (7) - 10 freq snsmw (7) - 1 freq snips (7) - 2 freq snvvn (7) - 1 freq snot (7) - 1 freq snx (7) - 1 freq snib (7) - 5 freq snowy (7) - 4 freq sna' (7) - 2 freq snc (7) - 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 |
ISN� |
Time to execute Levenshtein function - 0.329866 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.514487 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.060939 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.040313 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.000853 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. |