Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
irae (0) - 1 freq irnae (1) - 23 freq ira (1) - 7 freq iae (1) - 5 freq iraq (1) - 9 freq trae (1) - 1 freq frae (1) - 4566 freq iran (1) - 2 freq irate (1) - 1 freq ire (1) - 9 freq zrae (1) - 1 freq itae (1) - 10 freq rae (1) - 13 freq erae (1) - 1 freq grae (1) - 4 freq brae (1) - 285 freq gran (2) - 232 freq drame (2) - 23 freq xre (2) - 1 freq 'race (2) - 1 freq draw (2) - 176 freq iar (2) - 2 freq raed (2) - 21 freq irth (2) - 37 freq iya (2) - 1 freq |
irae (0) - 1 freq erae (1) - 1 freq ire (1) - 9 freq rae (1) - 13 freq ira (1) - 7 freq rie (2) - 1 freq airie (2) - 1 freq ara (2) - 1 freq rye (2) - 5 freq re (2) - 48 freq eire (2) - 3 freq iry (2) - 1 freq ere (2) - 288 freq raa (2) - 38 freq ora (2) - 1 freq ure (2) - 5 freq aire (2) - 61 freq ree (2) - 7 freq ir (2) - 1541 freq ray (2) - 17 freq ore (2) - 1 freq roe (2) - 15 freq iri (2) - 1 freq rue (2) - 19 freq ra (2) - 12 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 |
IRAE |
Time to execute Levenshtein function - 0.172595 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.317820 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.028624 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.038061 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.000922 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. |