| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irn (0) - 35 freq iry (1) - 1 freq ird (1) - 1 freq kirn (1) - 33 freq inn (1) - 29 freq irp (1) - 2 freq irno (1) - 1 freq ir' (1) - 4 freq iri (1) - 1 freq ern (1) - 14 freq irr (1) - 2 freq iin (1) - 2 freq irs (1) - 1 freq pirn (1) - 8 freq ian (1) - 202 freq rn (1) - 4 freq airn (1) - 50 freq yirn (1) - 3 freq irk (1) - 2 freq ipn (1) - 1 freq ir (1) - 1540 freq irw (1) - 1 freq irt (1) - 3 freq ira (1) - 7 freq girn (1) - 59 freq |
irn (0) - 35 freq yirn (1) - 3 freq airn (1) - 50 freq irna (1) - 22 freq urn (1) - 6 freq ern (1) - 14 freq iron (1) - 103 freq irno (1) - 1 freq rn (1) - 7 freq iran (1) - 2 freq erne (2) - 4 freq ron (2) - 12 freq aran (2) - 5 freq earn (2) - 41 freq iyurn (2) - 2 freq rin (2) - 452 freq in (2) - 44358 freq ien (2) - 3 freq erin (2) - 9 freq aren (2) - 3 freq run (2) - 623 freq arna (2) - 23 freq arun (2) - 2 freq airon (2) - 1 freq ran (2) - 448 freq |
SoundEx code - I650 ir'n - 1 freq i'rn - 1 freq 'iron - 2 freq irna - 22 freq iron - 103 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 - 103 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 |
IRN |
| Time to execute Levenshtein function - 0.248778 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.435585 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.033183 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.037951 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.000851 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. |