| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| joabs (0) - 33 freq jobs (1) - 78 freq joab (1) - 111 freq jabs (1) - 2 freq boabs (1) - 1 freq babs (2) - 2 freq loaby (2) - 3 freq jougs (2) - 9 freq joak's (2) - 1 freq joogs (2) - 3 freq jonas (2) - 2 freq noas (2) - 2 freq boaks (2) - 3 freq jaas (2) - 15 freq gobbs (2) - 20 freq jobby (2) - 10 freq joy's (2) - 1 freq gobs (2) - 4 freq joks (2) - 1 freq scabs (2) - 6 freq boobs (2) - 7 freq toass (2) - 2 freq doars (2) - 3 freq jows (2) - 2 freq jas (2) - 1 freq |
joabs (0) - 33 freq jabs (1) - 2 freq jobs (1) - 78 freq joab (2) - 111 freq boabs (2) - 1 freq dabs (3) - 5 freq jibes (3) - 2 freq jouks (3) - 10 freq saabs (3) - 1 freq joos (3) - 6 freq jars (3) - 21 freq lobs (3) - 1 freq jooks (3) - 14 freq jams (3) - 3 freq jags (3) - 9 freq jaks (3) - 1 freq jours (3) - 1 freq jaws (3) - 48 freq jokes (3) - 50 freq bobs (3) - 9 freq boas (3) - 1 freq joe's (3) - 4 freq obs (3) - 1 freq abs (3) - 1 freq gabs (3) - 3 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 - JBS jobs - 78 freq joabs - 33 freq job's - 4 freq jabs - 2 freq jubous - 1 freq gibbous - 2 freq jobbie's - 2 freq jeebies - 2 freq jubes - 3 freq jobbies - 3 freq gebbies - 1 freq jibes - 2 freq gebs - 2 freq gibbsy - 1 freq geebies - 1 freq |
JOABS |
| Time to execute Levenshtein function - 0.197990 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.355436 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.028704 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.037992 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.000901 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. |