| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iri (0) - 1 freq eri (1) - 1 freq wri (1) - 1 freq bri (1) - 2 freq ari (1) - 3 freq iki (1) - 1 freq ifi (1) - 1 freq irr (1) - 2 freq irs (1) - 1 freq irt (1) - 3 freq irip (1) - 1 freq irw (1) - 1 freq ™ri (1) - 1 freq iry (1) - 1 freq iti (1) - 1 freq iii (1) - 31 freq iris (1) - 3 freq ii (1) - 69 freq gri (1) - 1 freq irp (1) - 2 freq ird (1) - 1 freq sri (1) - 11 freq uri (1) - 7 freq ici (1) - 2 freq ir' (1) - 4 freq |
iri (0) - 1 freq ira (1) - 7 freq ri (1) - 117 freq uri (1) - 7 freq ir (1) - 1540 freq ire (1) - 9 freq iry (1) - 1 freq ari (1) - 3 freq eri (1) - 1 freq ara (2) - 1 freq er (2) - 627 freq air (2) - 970 freq roi (2) - 1 freq ery (2) - 15 freq ere (2) - 287 freq oru (2) - 1 freq r (2) - 446 freq ra (2) - 12 freq yr (2) - 16 freq ur (2) - 541 freq ria (2) - 1 freq oro (2) - 1 freq era (2) - 30 freq ry (2) - 7 freq erie (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 |
IRI |
| Time to execute Levenshtein function - 0.208806 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.354474 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.027533 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.037093 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.000796 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. |