| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itsna (0) - 1 freq isna (1) - 390 freq itsa (1) - 1 freq i'sna (1) - 3 freq inna (2) - 19 freq 'tina (2) - 1 freq isno (2) - 36 freq didsna (2) - 1 freq tina (2) - 17 freq isnae (2) - 558 freq its (2) - 3335 freq wesna (2) - 145 freq itsel (2) - 476 freq wusna (2) - 1 freq disna (2) - 401 freq imna (2) - 1 freq tyna (2) - 1 freq wisna (2) - 1039 freq pasna (2) - 1 freq isni (2) - 5 freq dusna (2) - 18 freq iona (2) - 125 freq tuna (2) - 9 freq hesna (2) - 12 freq itan (2) - 1 freq |
itsna (0) - 1 freq isna (2) - 390 freq i'sna (2) - 3 freq itsa (2) - 1 freq isny (3) - 6 freq itn (3) - 2 freq isn (3) - 20 freq hesna (3) - 12 freq tuna (3) - 9 freq wiusna (3) - 1 freq itan (3) - 1 freq sna (3) - 167 freq wasna (3) - 80 freq isnea (3) - 1 freq its' (3) - 2 freq husna (3) - 1 freq dusna (3) - 18 freq etna (3) - 2 freq hasna (3) - 29 freq hisna (3) - 28 freq isni (3) - 5 freq isno (3) - 36 freq wusna (3) - 1 freq itsel (3) - 476 freq wesna (3) - 145 freq |
SoundEx code - I325 itchin - 11 freq itichin - 1 freq idiosyncracy - 1 freq idiosyncrasies - 2 freq itsna - 1 freq itscominhame - 1 freq itsonlywitter - 1 freq idgmkep - 1 freq itsmosblog - 1 freq itsnoeasy - 1 freq itsanayefaeme - 3 freq itsneck - 1 freq itsneverbecky - 1 freq |
MetaPhone code - ITSN itsna - 1 freq |
ITSNA |
| Time to execute Levenshtein function - 0.423234 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.577552 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.027686 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.037675 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.001065 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. |