| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irna (0) - 22 freq iona (1) - 125 freq ira (1) - 7 freq wirna (1) - 34 freq imna (1) - 1 freq irno (1) - 1 freq izna (1) - 3 freq irn (1) - 35 freq irnae (1) - 23 freq inna (1) - 19 freq isna (1) - 390 freq arna (1) - 23 freq ina (1) - 99 freq iny (2) - 6 freq iin (2) - 2 freq inn' (2) - 2 freq €˜na (2) - 10 freq morna (2) - 12 freq wirnae (2) - 31 freq ia (2) - 5 freq itsa (2) - 1 freq iraq (2) - 9 freq dinna (2) - 1825 freq itn (2) - 2 freq inns (2) - 8 freq |
irna (0) - 22 freq irn (1) - 35 freq arna (1) - 23 freq irnae (1) - 23 freq irno (1) - 1 freq arena (2) - 41 freq urnae (2) - 32 freq rona (2) - 3 freq irony (2) - 13 freq urny (2) - 4 freq rana (2) - 1 freq ern (2) - 14 freq arne (2) - 1 freq iran (2) - 2 freq urn (2) - 6 freq iron (2) - 107 freq airn (2) - 52 freq rn (2) - 7 freq erne (2) - 4 freq arnae (2) - 18 freq yirn (2) - 3 freq irene (2) - 56 freq arni (2) - 3 freq ina (2) - 99 freq wirna (2) - 34 freq |
SoundEx code - I650 ir'n - 1 freq i'rn - 1 freq 'iron - 2 freq irna - 22 freq iron - 107 freq irnae - 23 freq irony - 13 freq irn - 35 freq irene - 56 freq irno - 1 freq i'worm - 1 freq i'rain - 10 freq iyurn - 2 freq iran - 2 freq ironie - 1 freq |
MetaPhone code - IRN ir'n - 1 freq i'rn - 1 freq 'iron - 2 freq irna - 22 freq iron - 107 freq irnae - 23 freq irony - 13 freq irn - 35 freq irene - 56 freq irno - 1 freq i'rain - 10 freq iran - 2 freq ironie - 1 freq |
IRNA |
| Time to execute Levenshtein function - 0.329868 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.405438 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.028686 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.036918 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.000901 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. |