| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jorim (0) - 3 freq joram (1) - 2 freq joris (1) - 1 freq jorum (1) - 1 freq oorie (2) - 42 freq yoeim (2) - 1 freq frim (2) - 1 freq oriam (2) - 1 freq doris (2) - 58 freq brim (2) - 17 freq comim (2) - 1 freq josie (2) - 18 freq scrim (2) - 1 freq jovi (2) - 1 freq jorvik (2) - 1 freq prim (2) - 2 freq joni (2) - 3 freq jom (2) - 1 freq forum (2) - 33 freq oim (2) - 14 freq jim (2) - 234 freq jiim (2) - 1 freq ferim (2) - 1 freq tori (2) - 1 freq dorik (2) - 5 freq |
jorim (0) - 3 freq jorum (1) - 1 freq joram (1) - 2 freq jrom (2) - 1 freq joris (2) - 1 freq trim (3) - 15 freq mrim (3) - 1 freq jorg (3) - 1 freq ferim (3) - 1 freq atrim (3) - 1 freq purim (3) - 1 freq jojum (3) - 1 freq grim (3) - 51 freq joryg (3) - 1 freq goram (3) - 1 freq jojom (3) - 1 freq worm (3) - 34 freq jiim (3) - 1 freq tarim (3) - 1 freq jim (3) - 234 freq oriam (3) - 1 freq frim (3) - 1 freq rim (3) - 14 freq jeremy (3) - 12 freq gorm (3) - 1 freq |
SoundEx code - J650 journey - 109 freq jsreen - 1 freq jorum - 1 freq jurney - 2 freq jrom - 1 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 - JRM jorum - 1 freq girmy - 1 freq jrom - 1 freq jeremey - 1 freq jeremy - 12 freq jeremiah - 4 freq jorim - 3 freq joram - 2 freq germ - 3 freq germy - 1 freq germá - 1 freq |
JORIM |
| Time to execute Levenshtein function - 0.296314 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.357405 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.027020 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.037095 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.000786 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. |