| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jrish (0) - 1 freq hrish (1) - 1 freq crish (1) - 1 freq trish (1) - 4 freq irish (1) - 157 freq juist (2) - 1764 freq rise (2) - 245 freq 'irish (2) - 2 freq trisha (2) - 9 freq drush (2) - 7 freq brash (2) - 5 freq arise (2) - 10 freq ris' (2) - 9 freq biish (2) - 1 freq rich (2) - 192 freq joris (2) - 1 freq €™ish (2) - 2 freq perish (2) - 12 freq iris (2) - 3 freq ris (2) - 41 freq trith (2) - 1 freq 'dish (2) - 2 freq clish (2) - 1 freq weish (2) - 4 freq parish (2) - 30 freq |
jrish (0) - 1 freq hrish (2) - 1 freq trish (2) - 4 freq irish (2) - 157 freq crish (2) - 1 freq josh (3) - 3 freq crush (3) - 21 freq jhsh (3) - 1 freq cresh (3) - 3 freq crash (3) - 51 freq juwish (3) - 1 freq verish (3) - 1 freq fresh (3) - 200 freq brush (3) - 95 freq rash (3) - 11 freq garish (3) - 1 freq jewish (3) - 11 freq jutish (3) - 1 freq frush (3) - 4 freq ersh (3) - 1 freq rishi (3) - 4 freq grush (3) - 1 freq jubish (3) - 2 freq rush (3) - 74 freq creish (3) - 5 freq |
SoundEx code - J620 jaurs - 15 freq jersey - 22 freq jerries - 11 freq jeers - 1 freq jerk - 8 freq jars - 21 freq jerks - 2 freq jrish - 1 freq jairus's - 2 freq jairus - 3 freq jericho - 9 freq jirg - 2 freq jauries - 2 freq jarr's - 1 freq jurie's - 1 freq jaÃrus's - 1 freq jaÃrus - 2 freq jours - 1 freq jawrs - 1 freq jorg - 1 freq jörg - 1 freq jirk - 1 freq jrc - 1 freq joris - 1 freq jury's - 1 freq jcrg - 1 freq juries - 1 freq joryg - 1 freq jerriais - 1 freq |
MetaPhone code - JRX jrish - 1 freq jericho - 9 freq |
JRISH |
| Time to execute Levenshtein function - 0.176236 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.357750 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.032853 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.037393 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.000878 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. |