| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeremy (0) - 12 freq jeemy (1) - 3 freq jeremey (1) - 1 freq wereny (2) - 2 freq deemy (2) - 1 freq jeems (2) - 91 freq erey (2) - 1 freq germy (2) - 1 freq jemmy (2) - 5 freq ermy (2) - 2 freq jerry (2) - 15 freq enemy (2) - 37 freq heresy (2) - 3 freq jeesy (2) - 2 freq jersey (2) - 22 freq jeely (2) - 45 freq hereby (2) - 3 freq merely (2) - 12 freq mere' (3) - 1 freq yerer- (3) - 1 freq jeet (3) - 1 freq jeezo (3) - 15 freq jeeve (3) - 1 freq feems (3) - 1 freq enem (3) - 2 freq |
jeremy (0) - 12 freq jeremey (1) - 1 freq jeemy (2) - 3 freq jerry (3) - 15 freq jersey (3) - 22 freq jorim (3) - 3 freq joram (3) - 2 freq ermy (3) - 2 freq jorum (3) - 1 freq jrom (3) - 1 freq jemmy (3) - 5 freq germy (3) - 1 freq jecm (4) - 1 freq jordy (4) - 4 freq frem (4) - 2 freq kreme (4) - 1 freq jer (4) - 1 freq erm (4) - 66 freq dreme (4) - 2 freq jerk (4) - 8 freq lrmy (4) - 1 freq jeert (4) - 2 freq fermi (4) - 5 freq jreid (4) - 1 freq jeemie (4) - 61 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 |
JEREMY |
| Time to execute Levenshtein function - 0.175371 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.328846 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.027974 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.038229 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.000906 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. |