| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeedgement (0) - 4 freq jecdgement (1) - 1 freq juidgement (2) - 1 freq joodgement (2) - 3 freq judgement (2) - 20 freq needlemen (3) - 1 freq judgment (3) - 7 freq enagement (3) - 1 freq meevement (3) - 3 freq jugement (3) - 3 freq jeedged (4) - 3 freq sediment (4) - 2 freq aveisement (4) - 4 freq weelkeent (4) - 1 freq segment (4) - 1 freq bellement (4) - 3 freq excrement (4) - 2 freq element (4) - 45 freq tenement (4) - 21 freq denouement (4) - 1 freq exitement (4) - 2 freq jeedge (4) - 8 freq degerent (4) - 1 freq ameesement (4) - 2 freq deevilment (4) - 2 freq |
jeedgement (0) - 4 freq judgement (2) - 20 freq joodgement (2) - 3 freq juidgement (2) - 1 freq jecdgement (2) - 1 freq judgment (3) - 7 freq jugement (4) - 3 freq judgemental (5) - 6 freq enagement (5) - 1 freq jugemint (5) - 1 freq juidgemental (5) - 1 freq engagement (6) - 28 freq denouement (6) - 1 freq regiment (6) - 21 freq obleegement (6) - 2 freq obleigement (6) - 2 freq jidgmental (6) - 1 freq degerent (6) - 1 freq segment (6) - 1 freq endowment (6) - 1 freq meevement (6) - 3 freq management (6) - 24 freq obligement (6) - 2 freq needlemen (6) - 1 freq sediment (6) - 2 freq |
SoundEx code - J325 judgin - 17 freq judgemental - 6 freq juidgin - 2 freq joodgement - 3 freq juidgement - 1 freq judgement - 20 freq judgment - 7 freq jeedgement - 4 freq jettisoned - 1 freq jettison - 2 freq judgment's - 1 freq jetsam - 1 freq juidgment's - 1 freq judgan - 1 freq jidgmental - 1 freq jeidgin - 1 freq juidgemental - 1 freq joodgin - 1 freq judging - 2 freq jkytjmmz - 1 freq |
MetaPhone code - JJMNT joodgement - 3 freq juidgement - 1 freq judgement - 20 freq jugement - 3 freq jugemint - 1 freq jeedgement - 4 freq |
JEEDGEMENT |
| Time to execute Levenshtein function - 0.204140 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.364252 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.027639 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.037261 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.000786 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. |