| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeedged (0) - 3 freq jeidged (1) - 1 freq jeedge (1) - 8 freq seeded (2) - 3 freq weeded (2) - 1 freq judged (2) - 16 freq meeded (2) - 1 freq pledged (2) - 5 freq fledged (2) - 3 freq weenged (2) - 1 freq gledged (2) - 1 freq heedge (2) - 1 freq juidged (2) - 4 freq edged (2) - 9 freq jeered (2) - 1 freq deedled (2) - 1 freq dredged (2) - 3 freq leeded (2) - 1 freq jeeled (2) - 4 freq needed (2) - 143 freq wedged (2) - 3 freq reenged (2) - 8 freq hedged (2) - 2 freq jeidge (2) - 2 freq peenged (2) - 2 freq |
jeedged (0) - 3 freq jeidged (1) - 1 freq juidged (2) - 4 freq judged (2) - 16 freq jeedge (2) - 8 freq edged (3) - 9 freq jeidge (3) - 2 freq hedged (3) - 2 freq wedged (3) - 3 freq nidged (4) - 1 freq jeidgin (4) - 1 freq fidged (4) - 7 freq lodged (4) - 6 freq mudged (4) - 1 freq radged (4) - 1 freq jinged (4) - 1 freq jaded (4) - 3 freq jigged (4) - 4 freq judge (4) - 222 freq jogged (4) - 2 freq dodged (4) - 6 freq juidges (4) - 1 freq judges (4) - 19 freq nudged (4) - 5 freq budged (4) - 1 freq |
SoundEx code - J323 juidged - 4 freq jute-shuttlt - 1 freq judged - 16 freq jatest - 1 freq jeedged - 3 freq jetsettin - 1 freq jeidged - 1 freq jdsdawson - 1 freq jhdqd - 2 freq |
MetaPhone code - JJT juidged - 4 freq judged - 16 freq joogied - 1 freq jeedged - 3 freq jeegit - 1 freq jeidged - 1 freq |
JEEDGED |
| Time to execute Levenshtein function - 0.253026 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.620867 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.075925 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.092263 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.000845 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. |