| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heidaches (0) - 2 freq heidache (1) - 7 freq headache (2) - 4 freq heedache (2) - 2 freq beaches (3) - 11 freq peaches (3) - 2 freq weidaes (3) - 2 freq leitches (3) - 1 freq heichs (3) - 2 freq hitches (3) - 2 freq heidatanes (3) - 1 freq heidcases (3) - 1 freq heidschip (3) - 1 freq eitches (3) - 1 freq heicher (3) - 30 freq heides (3) - 1 freq hertache (3) - 1 freq heidteacher (3) - 1 freq leaches (3) - 3 freq heidrace (3) - 1 freq heidlines (3) - 11 freq teaches (3) - 3 freq heidcrest (3) - 1 freq heichest (3) - 24 freq reaches (3) - 21 freq |
heidaches (0) - 2 freq heidache (2) - 7 freq heedache (3) - 2 freq headache (3) - 4 freq heichs (4) - 2 freq hitches (4) - 2 freq heidcases (4) - 1 freq heidlichts (5) - 7 freq heidies (5) - 4 freq heirarchies (5) - 1 freq reaches (5) - 21 freq heidcrest (5) - 1 freq heichest (5) - 24 freq heichts (5) - 11 freq hooches (5) - 1 freq daiches (5) - 2 freq bodachs (5) - 2 freq hutches (5) - 1 freq teaches (5) - 3 freq heuchs (5) - 3 freq hatches (5) - 4 freq heid-anes (5) - 1 freq leitches (5) - 1 freq peaches (5) - 2 freq heidschip (5) - 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 - HTXS heidaches - 2 freq |
HEIDACHES |
| Time to execute Levenshtein function - 0.200705 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.343380 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.026991 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.036894 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.000774 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. |