| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irish (0) - 157 freq hrish (1) - 1 freq trish (1) - 4 freq crish (1) - 1 freq jrish (1) - 1 freq airish (1) - 38 freq 'irish (1) - 2 freq iris (1) - 3 freq trist (2) - 3 freq irks (2) - 1 freq bitish (2) - 1 freq airis (2) - 1 freq rist (2) - 15 freq 'rise (2) - 3 freq isiah (2) - 1 freq ersh (2) - 1 freq swish (2) - 7 freq briss (2) - 1 freq rishi (2) - 4 freq kris (2) - 1 freq prisk (2) - 1 freq wish (2) - 376 freq trisha (2) - 9 freq hish (2) - 1 freq risp (2) - 2 freq |
irish (0) - 157 freq airish (1) - 38 freq rishi (2) - 4 freq rush (2) - 74 freq rash (2) - 11 freq iris (2) - 3 freq ersh (2) - 1 freq trish (2) - 4 freq crish (2) - 1 freq 'irish (2) - 2 freq hrish (2) - 1 freq jrish (2) - 1 freq righ (3) - 1 freq ris (3) - 41 freq crush (3) - 21 freq weish (3) - 4 freq fresh (3) - 200 freq neirish (3) - 2 freq airisch (3) - 6 freq rich (3) - 192 freq freish (3) - 3 freq perish (3) - 12 freq biish (3) - 1 freq fuish (3) - 1 freq rih (3) - 1 freq |
SoundEx code - I620 irish - 157 freq 'irish - 2 freq irks - 1 freq ihere's - 5 freq irois - 1 freq irs - 1 freq iraq - 9 freq iraqi - 4 freq 'ir's - 3 freq i'rice - 1 freq irk - 2 freq Éire's - 2 freq iris - 3 freq €˜irish - 2 freq €™irs - 1 freq €œirish - 2 freq irrx - 1 freq iirc - 1 freq |
MetaPhone code - IRX irish - 157 freq 'irish - 2 freq €˜irish - 2 freq €œirish - 2 freq |
IRISH |
| Time to execute Levenshtein function - 0.191151 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.353023 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.037429 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.037962 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.000968 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. |