| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hedges (0) - 38 freq henges (1) - 1 freq heges (1) - 1 freq aedges (1) - 3 freq hedge (1) - 41 freq ledges (1) - 3 freq hedged (1) - 2 freq edges (1) - 32 freq wedges (1) - 1 freq ledgers (2) - 2 freq badges (2) - 11 freq heughs (2) - 7 freq peges (2) - 1 freq hedley (2) - 1 freq heizes (2) - 7 freq aedge (2) - 8 freq heres (2) - 8 freq aedies (2) - 1 freq hege (2) - 2 freq heedge (2) - 1 freq hodged (2) - 3 freq heaves (2) - 2 freq hides (2) - 14 freq helgas (2) - 1 freq fudges (2) - 2 freq |
hedges (0) - 38 freq hedged (2) - 2 freq edges (2) - 32 freq ledges (2) - 3 freq wedges (2) - 1 freq henges (2) - 1 freq hedge (2) - 41 freq heges (2) - 1 freq aedges (2) - 3 freq nudges (3) - 4 freq mudges (3) - 1 freq hades (3) - 4 freq hodge (3) - 3 freq heds (3) - 1 freq hinges (3) - 19 freq dodges (3) - 1 freq fidges (3) - 2 freq gadges (3) - 1 freq judges (3) - 19 freq heides (3) - 1 freq heidies (3) - 4 freq radges (3) - 1 freq hedgie (3) - 3 freq midges (3) - 26 freq ludges (3) - 2 freq |
SoundEx code - H322 hedges - 38 freq hedgehogs - 12 freq hedgehog - 39 freq hitches - 2 freq hutchison's - 1 freq heidaches - 2 freq hotses - 1 freq hatches - 4 freq hutchison - 5 freq hatche's - 1 freq hedgehog's - 2 freq hedgehugs - 3 freq hedgehug - 9 freq hitchcock - 1 freq hedgikies - 1 freq hothooses - 1 freq hutches - 1 freq heidcases - 1 freq hutcheson's - 1 freq hutchies' - 1 freq hotchkissrhona - 7 freq hedgehogpoetry - 1 freq |
MetaPhone code - HJS hedges - 38 freq heges - 1 freq hoagies - 1 freq |
HEDGES |
| Time to execute Levenshtein function - 0.189729 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.358493 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.028858 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.037823 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.001042 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. |