| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hedgikies (0) - 1 freq heidies (3) - 4 freq hedges (3) - 38 freq hedgie (3) - 3 freq heivies (3) - 1 freq herries (4) - 4 freq daisies (4) - 20 freq hungirie (4) - 1 freq destinies (4) - 1 freq leddies (4) - 12 freq seignifies (4) - 1 freq versities (4) - 4 freq dinkies (4) - 1 freq hingmies (4) - 2 freq derkies (4) - 1 freq hedgehogs (4) - 12 freq heavies (4) - 5 freq bikies (4) - 1 freq buikies (4) - 3 freq heides (4) - 1 freq hygienes (4) - 1 freq realities (4) - 9 freq sheddies (4) - 1 freq teddies (4) - 2 freq redskins (4) - 2 freq |
hedgikies (0) - 1 freq hedges (4) - 38 freq hedgie (5) - 3 freq heidies (5) - 4 freq heidins (6) - 1 freq ledges (6) - 3 freq gadgies (6) - 28 freq darkies (6) - 2 freq budgies (6) - 1 freq hegris (6) - 2 freq huggises (6) - 1 freq hikes (6) - 1 freq henges (6) - 1 freq dookies (6) - 1 freq hoagies (6) - 1 freq edges (6) - 32 freq heidie's (6) - 5 freq wedges (6) - 1 freq dikes (6) - 3 freq hedgerows (6) - 1 freq haggises (6) - 3 freq haddies (6) - 2 freq heedlines (6) - 1 freq mudgies (6) - 1 freq deukies (6) - 1 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 - HJKS hedgikies - 1 freq |
HEDGIKIES |
| Time to execute Levenshtein function - 0.310930 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.460957 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.027393 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.037615 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.000868 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. |