| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jarrin (0) - 2 freq warrin (1) - 1 freq garrin (1) - 35 freq earrin (1) - 1 freq tarrin (1) - 1 freq barrin (1) - 7 freq jardin (1) - 2 freq warin (2) - 2 freq marryin (2) - 1 freq cairrin (2) - 1 freq carryin (2) - 16 freq warrim (2) - 1 freq earrins (2) - 2 freq yarkin (2) - 4 freq margin (2) - 3 freq martin (2) - 47 freq garron (2) - 6 freq forrin (2) - 6 freq harkin (2) - 5 freq borrin (2) - 1 freq wairin (2) - 1 freq jappin (2) - 1 freq jaggin (2) - 9 freq harrit (2) - 1 freq jattin (2) - 1 freq |
jarrin (0) - 2 freq jardin (2) - 2 freq tarrin (2) - 1 freq barrin (2) - 7 freq earrin (2) - 1 freq warrin (2) - 1 freq garrin (2) - 35 freq gurrin (3) - 1 freq hurrin (3) - 1 freq barren (3) - 16 freq herrin (3) - 24 freq rairin (3) - 22 freq barron (3) - 7 freq jirgin (3) - 2 freq jeerin (3) - 3 freq jargon (3) - 3 freq merrin (3) - 1 freq serrin (3) - 5 freq birrin (3) - 4 freq jerkin (3) - 2 freq errin (3) - 1 freq carron (3) - 4 freq jirdin (3) - 3 freq jerrie (3) - 5 freq jardine (3) - 29 freq |
SoundEx code - J650 journey - 111 freq jsreen - 1 freq jorum - 1 freq jurney - 2 freq jeerin - 3 freq jeremey - 1 freq jeremy - 12 freq journo - 1 freq jehoram - 2 freq jeremiah - 4 freq jorim - 3 freq joram - 2 freq jurnay - 6 freq jurnai - 1 freq journey' - 1 freq journay - 3 freq €œjourney - 1 freq jarrin - 2 freq |
MetaPhone code - JRN journey - 111 freq girn - 60 freq jurney - 2 freq jeerin - 3 freq journo - 1 freq gern - 1 freq girny - 4 freq jurnay - 6 freq geyran - 1 freq girnie - 3 freq gearin - 2 freq gyran - 1 freq jurnai - 1 freq giorno - 2 freq journey' - 1 freq journay - 3 freq gerrin' - 2 freq €œjourney - 1 freq 'girn' - 1 freq jarrin - 2 freq 'girny - 1 freq |
JARRIN |
| Time to execute Levenshtein function - 0.196500 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.371515 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.027901 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.038304 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.000924 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. |