| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jecdgement (0) - 1 freq jeedgement (1) - 4 freq judgement (2) - 20 freq joodgement (2) - 3 freq juidgement (2) - 1 freq judgment (3) - 7 freq decorement (3) - 1 freq jugement (3) - 3 freq enagement (3) - 1 freq management (4) - 24 freq endowment (4) - 1 freq tenement (4) - 21 freq debasement (4) - 1 freq judgemental (4) - 6 freq bemusement (4) - 2 freq wycement (4) - 1 freq segment (4) - 1 freq sediment (4) - 2 freq exitement (4) - 2 freq element (4) - 45 freq juidgemental (4) - 1 freq refinement (4) - 3 freq bellement (4) - 3 freq regiment (4) - 21 freq inclement (4) - 3 freq |
jecdgement (0) - 1 freq jeedgement (2) - 4 freq joodgement (3) - 3 freq juidgement (3) - 1 freq judgement (3) - 20 freq judgment (4) - 7 freq jugement (5) - 3 freq judgemental (6) - 6 freq juidgemental (6) - 1 freq enagement (6) - 1 freq decorement (6) - 1 freq jugemint (6) - 1 freq excitement (7) - 97 freq incitement (7) - 1 freq engagement (7) - 28 freq casement (7) - 3 freq cement (7) - 27 freq ingadgment (7) - 1 freq inclement (7) - 3 freq jidgmental (7) - 1 freq mandement (7) - 2 freq excrement (7) - 2 freq denouement (7) - 1 freq obligement (7) - 2 freq degerent (7) - 1 freq |
SoundEx code - J232 jaikits - 1 freq justice - 67 freq juistice - 11 freq jakits - 2 freq jeests - 7 freq jaikets - 13 freq jaiket's - 3 freq jeists - 3 freq jaickets - 15 freq jests - 2 freq justices - 1 freq jackets - 3 freq 'justice - 1 freq jecdgement - 1 freq jaicket's - 1 freq justis - 2 freq jaykets - 1 freq justdaj - 1 freq jeckets - 1 freq justacard - 1 freq joshtjordan - 1 freq jackhutchison - 1 freq justsingsco - 1 freq jojoteesend - 1 freq justsingscot - 1 freq |
MetaPhone code - JKJMNT jecdgement - 1 freq |
JECDGEMENT |
| Time to execute Levenshtein function - 0.196915 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.383829 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.028311 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.037074 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.000824 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. |