| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| judges (0) - 19 freq judge (1) - 222 freq mudges (1) - 1 freq juidges (1) - 1 freq judge's (1) - 1 freq nudges (1) - 4 freq ludges (1) - 2 freq fudges (1) - 1 freq judged (1) - 16 freq junes (2) - 1 freq sudgers (2) - 5 freq dodges (2) - 2 freq grudges (2) - 2 freq jugs (2) - 4 freq fidges (2) - 2 freq ludge (2) - 22 freq budged (2) - 1 freq budgets (2) - 6 freq jungles (2) - 1 freq gurges (2) - 1 freq juden (2) - 1 freq jug's (2) - 1 freq jungen (2) - 1 freq bulges (2) - 2 freq judaea (2) - 1 freq |
judges (0) - 19 freq juidges (1) - 1 freq ludges (2) - 2 freq judged (2) - 16 freq nudges (2) - 4 freq fudges (2) - 1 freq judge's (2) - 1 freq judge (2) - 222 freq mudges (2) - 1 freq judgan (3) - 1 freq mudgies (3) - 1 freq badges (3) - 11 freq judas (3) - 24 freq ledges (3) - 3 freq edges (3) - 30 freq judgin (3) - 17 freq jude's (3) - 1 freq juidged (3) - 4 freq juidge (3) - 17 freq aedges (3) - 3 freq hedges (3) - 38 freq wedges (3) - 1 freq wadges (3) - 1 freq ridges (3) - 6 freq fidges (3) - 2 freq |
SoundEx code - J322 judge-hke-mair - 1 freq judges - 19 freq judge's - 1 freq juidges - 1 freq judgejules - 4 freq |
MetaPhone code - JJS judges - 19 freq judge's - 1 freq juidges - 1 freq ju-jus - 1 freq |
JUDGES |
| Time to execute Levenshtein function - 0.190173 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.353824 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.027491 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.038726 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.001093 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. |