| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeremey (0) - 1 freq jeremy (1) - 12 freq jeemy (2) - 3 freq jersey (2) - 22 freq remedy (3) - 4 freq serene (3) - 2 freq jeemie (3) - 61 freq jeered (3) - 1 freq deemy (3) - 1 freq jemmy (3) - 5 freq hermer (3) - 1 freq beremael (3) - 1 freq chreme (3) - 1 freq jerkily (3) - 1 freq berkeley (3) - 3 freq termes (3) - 1 freq termed (3) - 1 freq jeremiah (3) - 4 freq sergey (3) - 1 freq werenay (3) - 1 freq jeeled (3) - 4 freq jsreen (3) - 1 freq teemed (3) - 21 freq germy (3) - 1 freq hermed (3) - 2 freq |
jeremey (0) - 1 freq jeremy (1) - 12 freq jersey (3) - 22 freq jeemy (3) - 3 freq creme (4) - 1 freq jrom (4) - 1 freq dreme (4) - 2 freq jeremiah (4) - 4 freq jerrie (4) - 5 freq jurney (4) - 2 freq jorum (4) - 1 freq germy (4) - 1 freq kreme (4) - 1 freq crumey (4) - 2 freq jeered (4) - 1 freq jorim (4) - 3 freq jeemie (4) - 61 freq joram (4) - 2 freq jurymen (4) - 22 freq breme (4) - 1 freq jemmy (4) - 5 freq jerry (4) - 15 freq ermy (4) - 2 freq serum (5) - 4 freq jarvie (5) - 5 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 |
JEREMEY |
| Time to execute Levenshtein function - 0.188855 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.338314 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.027260 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.038137 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.000840 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. |