| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jps (0) - 3 freq jns (1) - 1 freq kps (1) - 1 freq pps (1) - 1 freq jjs (1) - 52 freq j's (1) - 2 freq jpu (1) - 1 freq yps (1) - 1 freq ups (1) - 22 freq gps (1) - 4 freq jhs (1) - 2 freq hps (1) - 1 freq jpl (1) - 2 freq rps (1) - 17 freq fps (1) - 1 freq japs (1) - 12 freq ops (1) - 1 freq jpm (1) - 1 freq dps (1) - 1 freq jus (1) - 39 freq jas (1) - 1 freq ips (1) - 2 freq jis (1) - 36 freq ps (1) - 68 freq js (1) - 5 freq |
jps (0) - 3 freq japs (1) - 12 freq ips (2) - 2 freq jas (2) - 1 freq jis (2) - 36 freq dps (2) - 1 freq ps (2) - 68 freq jus (2) - 39 freq mps (2) - 31 freq japes (2) - 1 freq jaups (2) - 3 freq jaips (2) - 1 freq vps (2) - 1 freq jpm (2) - 1 freq bps (2) - 1 freq js (2) - 5 freq jp (2) - 7 freq j's (2) - 2 freq jpu (2) - 1 freq jjs (2) - 52 freq ops (2) - 1 freq jns (2) - 1 freq kps (2) - 1 freq yps (2) - 1 freq pps (2) - 1 freq |
SoundEx code - J120 jobs - 78 freq joabs - 33 freq japes - 1 freq job's - 4 freq jabs - 2 freq jubous - 1 freq jaups - 3 freq jobbie's - 2 freq jawbox - 5 freq jeeves - 3 freq jps - 3 freq jeebies - 2 freq japs - 12 freq jaw-box - 3 freq jubes - 3 freq jubish - 2 freq jobbies - 3 freq javig - 1 freq joves - 2 freq jaips - 1 freq jehovey's - 1 freq jfk - 1 freq €˜jawbox - 1 freq jibes - 2 freq jcgibwsxsx - 1 freq jvqj - 1 freq jpzj - 1 freq joefc - 1 freq jaffa's - 1 freq jbqz - 1 freq jeff's - 1 freq jfqo - 1 freq jxcvzo - 1 freq jeffco - 1 freq jssjsyvsa - 1 freq jbuaq - 1 freq |
MetaPhone code - JPS japes - 1 freq gypes - 17 freq jaups - 3 freq jps - 3 freq japs - 12 freq jaips - 1 freq gypsy - 2 freq gypos - 1 freq gype's - 1 freq |
JPS |
| Time to execute Levenshtein function - 0.200185 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.344742 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.030427 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.036905 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.000789 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. |