| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hedgehog (0) - 39 freq hedgehogs (1) - 12 freq hedgehug (1) - 9 freq hedgehugs (2) - 3 freq hedgehog's (2) - 2 freq hedgerow (2) - 2 freq hedgerows (3) - 1 freq highog (3) - 1 freq hedged (3) - 2 freq hedges (3) - 38 freq hedge (3) - 41 freq heigher (4) - 1 freq heehee (4) - 2 freq wedges (4) - 1 freq edges (4) - 32 freq red-hot (4) - 2 freq hodged (4) - 3 freq hegwig (4) - 1 freq hqgnhg (4) - 1 freq heughan (4) - 1 freq hidiehole (4) - 1 freq henges (4) - 1 freq heights (4) - 3 freq hudge (4) - 1 freq ledges (4) - 3 freq |
hedgehog (0) - 39 freq hedgehug (1) - 9 freq hedgehogs (2) - 12 freq hedgehugs (3) - 3 freq highog (4) - 1 freq hedgerow (4) - 2 freq hedgehog's (4) - 2 freq hedges (5) - 38 freq hedge (5) - 41 freq hedged (5) - 2 freq hodge (6) - 3 freq hedgie (6) - 3 freq height (6) - 45 freq heighly (6) - 1 freq heedgear (6) - 1 freq heedge (6) - 1 freq hudge (6) - 1 freq heigh (6) - 7 freq heughs (6) - 7 freq heugh (6) - 4 freq heidgear (6) - 1 freq hodgson (6) - 2 freq hqgnhg (6) - 1 freq hegwig (6) - 1 freq heigher (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 - HJHK hedgehog - 39 freq hedgehug - 9 freq |
HEDGEHOG |
| Time to execute Levenshtein function - 0.201807 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.367297 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.027336 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.037163 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.000926 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. |