| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ire (0) - 9 freq irae (1) - 1 freq iye (1) - 10 freq irs (1) - 1 freq ipe (1) - 1 freq wire (1) - 62 freq irn (1) - 35 freq iri (1) - 1 freq irh (1) - 1 freq irw (1) - 1 freq ie (1) - 40 freq dire (1) - 9 freq ere (1) - 287 freq re (1) - 48 freq are (1) - 5053 freq ore (1) - 1 freq pre (1) - 10 freq ir' (1) - 4 freq lire (1) - 2 freq ile (1) - 65 freq ise (1) - 2 freq sire (1) - 8 freq vire (1) - 2 freq ir (1) - 1540 freq rre (1) - 1 freq |
ire (0) - 9 freq ere (1) - 287 freq ira (1) - 7 freq re (1) - 48 freq aire (1) - 61 freq are (1) - 5053 freq ore (1) - 1 freq iri (1) - 1 freq ir (1) - 1540 freq eire (1) - 3 freq irae (1) - 1 freq iry (1) - 1 freq ure (1) - 5 freq era (2) - 30 freq uri (2) - 7 freq yare (2) - 1 freq oure (2) - 7 freq ayre (2) - 8 freq rey (2) - 12 freq ur (2) - 541 freq yere (2) - 9 freq rae (2) - 13 freq r (2) - 446 freq area (2) - 165 freq ior (2) - 1 freq |
SoundEx code - I600 ir - 1540 freq irae - 1 freq 'ir - 11 freq ire - 9 freq iry - 1 freq ihere - 6 freq ihor - 1 freq ira - 7 freq ir' - 4 freq iwer - 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 - 1540 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 |
IRE |
| Time to execute Levenshtein function - 0.246881 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.615926 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.080317 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.088703 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.000821 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. |