| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irr (0) - 2 freq ior (1) - 1 freq iar (1) - 2 freq jirr (1) - 1 freq irw (1) - 1 freq irs (1) - 1 freq irt (1) - 3 freq urr (1) - 40 freq mirr (1) - 3 freq tirr (1) - 5 freq zrr (1) - 1 freq rr (1) - 1 freq pirr (1) - 2 freq ivr (1) - 1 freq grr (1) - 2 freq ird (1) - 1 freq err (1) - 40 freq ier (1) - 1 freq irrx (1) - 1 freq irp (1) - 2 freq brr (1) - 5 freq firr (1) - 2 freq iry (1) - 1 freq ire (1) - 9 freq irn (1) - 35 freq |
irr (0) - 2 freq urr (1) - 40 freq orr (1) - 16 freq err (1) - 40 freq rr (1) - 1 freq irk (2) - 2 freq ir (2) - 1541 freq rar (2) - 1 freq ira (2) - 7 freq birr (2) - 24 freq jrr (2) - 1 freq irh (2) - 1 freq arra (2) - 32 freq iri (2) - 1 freq ir' (2) - 4 freq airer (2) - 1 freq erra (2) - 3 freq rior (2) - 1 freq rre (2) - 1 freq rer (2) - 3 freq kirr (2) - 2 freq rur (2) - 3 freq virr (2) - 57 freq arry (2) - 1 freq orra (2) - 172 freq |
SoundEx code - I600 ir - 1541 freq irae - 1 freq 'ir - 11 freq ire - 9 freq iry - 1 freq ihere - 6 freq ihor - 1 freq iwer - 5 freq ira - 7 freq ir' - 4 freq æir - 1 freq i'air - 7 freq i'war - 1 freq Ÿiyor - 1 freq ihre - 1 freq €™ir - 5 freq Éire - 2 freq €œir - 2 freq €˜irie - 1 freq €˜ir - 1 freq irr - 2 freq irw - 1 freq ier - 1 freq iar - 2 freq iri - 1 freq irh - 1 freq ior - 1 freq |
MetaPhone code - IR ir - 1541 freq irae - 1 freq 'ir - 11 freq ire - 9 freq iry - 1 freq ira - 7 freq ir' - 4 freq æir - 1 freq i'air - 7 freq ihre - 1 freq €™ir - 5 freq Éire - 2 freq €œir - 2 freq €˜irie - 1 freq €˜ir - 1 freq irr - 2 freq irw - 1 freq ier - 1 freq iar - 2 freq iri - 1 freq irh - 1 freq ior - 1 freq |
IRR |
| Time to execute Levenshtein function - 0.191243 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.341136 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.027893 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.036838 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.000864 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. |