| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| giuseppe (0) - 1 freq fausette (4) - 1 freq girsle (4) - 2 freq grumpie (4) - 1 freq gruppt (4) - 10 freq hosepipe (4) - 1 freq giese (4) - 2 freq usetae (4) - 1 freq miserie (4) - 5 freq gluepot (4) - 1 freq insece (4) - 1 freq guiseppim (4) - 6 freq gustie (4) - 3 freq grupp (4) - 2 freq girse (4) - 89 freq gousterie (4) - 1 freq giep (4) - 1 freq hissepw (4) - 1 freq gruppie (4) - 2 freq guse (4) - 1 freq hirselfe (4) - 1 freq gruppy (4) - 1 freq biueee (4) - 1 freq insense (4) - 7 freq girssle (4) - 1 freq |
giuseppe (0) - 1 freq grupp (5) - 2 freq guiseppim (5) - 6 freq gruppy (5) - 1 freq hosepipe (5) - 1 freq gauspit (5) - 1 freq gruppie (5) - 2 freq gausp (5) - 2 freq grappa (6) - 3 freq sappie (6) - 12 freq gasps (6) - 7 freq grippy (6) - 9 freq mspp (6) - 1 freq guelph (6) - 1 freq gausie (6) - 3 freq golspie (6) - 1 freq gustave (6) - 1 freq gaspan (6) - 1 freq grippie (6) - 7 freq sappy (6) - 19 freq gasp (6) - 39 freq suppy (6) - 1 freq suppie (6) - 24 freq gospel (6) - 29 freq gestapo (6) - 4 freq |
SoundEx code - G210 gasp - 39 freq gossip - 30 freq giuseppe - 1 freq gossipy - 1 freq gausp - 2 freq gogzyboy - 1 freq gooigiboi - 1 freq gazebo - 1 freq gjgaussbv - 1 freq ghsfp - 4 freq gagzb - 1 freq |
MetaPhone code - JSP giuseppe - 1 freq josep - 1 freq |
GIUSEPPE |
| Time to execute Levenshtein function - 0.224416 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.406897 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.028319 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.039295 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.000935 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. |