| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ier (0) - 1 freq fier (1) - 6 freq ien (1) - 3 freq ivr (1) - 1 freq hier (1) - 3 freq iek (1) - 1 freq ger (1) - 2 freq cer (1) - 1 freq ler (1) - 1 freq ieh (1) - 1 freq rer (1) - 3 freq tier (1) - 36 freq ker (1) - 24 freq gier (1) - 2 freq ir (1) - 1540 freq ie (1) - 40 freq irr (1) - 2 freq iel (1) - 1 freq oer (1) - 238 freq jer (1) - 1 freq wier (1) - 2 freq der (1) - 302 freq iep (1) - 1 freq iar (1) - 2 freq ior (1) - 1 freq |
ier (0) - 1 freq yer (1) - 7938 freq er (1) - 627 freq aer (1) - 67 freq ir (1) - 1540 freq oer (1) - 238 freq ior (1) - 1 freq iar (1) - 2 freq eer (1) - 192 freq auer (2) - 1 freq air (2) - 970 freq re (2) - 48 freq ery (2) - 15 freq rey (2) - 12 freq yir (2) - 1337 freq fier (2) - 6 freq ire (2) - 9 freq iry (2) - 1 freq ayr (2) - 50 freq yr (2) - 16 freq ar (2) - 208 freq yur (2) - 221 freq yor (2) - 4 freq yar (2) - 3 freq oor (2) - 3937 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 |
IER |
| Time to execute Levenshtein function - 0.308453 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.414864 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.037624 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.047735 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.000865 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. |