| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ionafyfe (0) - 94 freq coaffe (3) - 1 freq caffe (4) - 1 freq donate (4) - 9 freq onawie (4) - 1 freq isnae (4) - 558 freq injfeft (4) - 1 freq innate (4) - 3 freq dinnaye (4) - 2 freq inane (4) - 2 freq in-bye (4) - 1 freq onlyke (4) - 2 freq infeft (4) - 2 freq iona's (4) - 10 freq tonallie (4) - 1 freq nayme (4) - 2 freq confuse (4) - 8 freq infy (4) - 1 freq bonfire (4) - 28 freq baffe (4) - 2 freq pinafore (4) - 1 freq gonaae (4) - 1 freq confide (4) - 4 freq ioniae (4) - 1 freq gonae (4) - 38 freq |
ionafyfe (0) - 94 freq inuff (4) - 1 freq naff (4) - 2 freq naffu (4) - 1 freq coaffe (4) - 1 freq nefife (4) - 1 freq niff (5) - 1 freq oaffae (5) - 2 freq infy (5) - 1 freq oaff (5) - 110 freq baffe (5) - 2 freq enoff (5) - 1 freq nyaff (5) - 24 freq infeft (5) - 2 freq nfyfc (5) - 1 freq anuff (5) - 28 freq oaffy (5) - 3 freq caffe (5) - 1 freq enuff (5) - 12 freq anoff (5) - 6 freq fyfe (5) - 14 freq gaffe (5) - 1 freq onafi (5) - 1 freq douff (6) - 2 freq ohff (6) - 1 freq |
SoundEx code - I511 infeft - 2 freq invioved - 1 freq infoboxes - 3 freq infobox - 1 freq imbibe - 1 freq immoveable - 1 freq infeftments - 1 freq ionafyfe - 94 freq infobears - 1 freq impoverished - 1 freq iainpope - 6 freq |
MetaPhone code - INFF ionafyfe - 94 freq |
IONAFYFE |
| Time to execute Levenshtein function - 0.221085 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.408990 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.028177 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.042597 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.000828 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. |