| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irae (0) - 1 freq iraq (1) - 8 freq irnae (1) - 23 freq brae (1) - 283 freq ira (1) - 7 freq grae (1) - 4 freq irate (1) - 1 freq itae (1) - 10 freq zrae (1) - 1 freq iran (1) - 2 freq trae (1) - 1 freq frae (1) - 4547 freq iae (1) - 5 freq rae (1) - 13 freq ire (1) - 9 freq erae (1) - 1 freq crag (2) - 8 freq shae (2) - 853 freq frag (2) - 1 freq tras (2) - 1 freq rade (2) - 24 freq erne (2) - 4 freq chae (2) - 7 freq iime (2) - 2 freq draem (2) - 15 freq |
irae (0) - 1 freq rae (1) - 13 freq erae (1) - 1 freq ira (1) - 7 freq ire (1) - 9 freq eire (2) - 3 freq ree (2) - 7 freq iri (2) - 1 freq iry (2) - 1 freq urie (2) - 1 freq rie (2) - 1 freq ray (2) - 17 freq iar (2) - 2 freq ere (2) - 287 freq ora (2) - 1 freq erie (2) - 1 freq ara (2) - 1 freq ore (2) - 1 freq ra (2) - 12 freq rye (2) - 5 freq rue (2) - 19 freq ure (2) - 5 freq roe (2) - 15 freq are (2) - 5053 freq ir (2) - 1540 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 |
IRAE |
| Time to execute Levenshtein function - 0.212579 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.479267 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.028209 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.047883 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.001136 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. |