Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tousie-heidit (0) - 2 freq tuim-heidit (3) - 4 freq tattie-heidit (3) - 1 freq brosie-heidit (3) - 4 freq blondie-heidit (4) - 1 freq hie-heidit (4) - 1 freq monie-leidit (4) - 1 freq house-heid (4) - 1 freq tow-heidit (4) - 1 freq sappie-heidit (4) - 4 freq peerie-heidit (4) - 4 freq stufit-heidit (4) - 1 freq peerie-heedit (5) - 1 freq fufty-heidit (5) - 1 freq fause-hertit (5) - 1 freq snake-heidit (5) - 1 freq scabbie-heidit (5) - 1 freq thrawn-heidit (5) - 1 freq hale-heidit (5) - 5 freq sodie-heid (5) - 1 freq curly-heidit (5) - 1 freq hail-heidit (5) - 2 freq rid-heidit (5) - 2 freq haurd-heidit (5) - 1 freq daurk-heidit (5) - 2 freq |
tousie-heidit (0) - 2 freq tuim-heidit (4) - 4 freq brosie-heidit (5) - 4 freq tow-heidit (5) - 1 freq tattie-heidit (5) - 1 freq house-heid (6) - 1 freq peerie-heidit (6) - 4 freq hie-heidit (6) - 1 freq fair-heidit (7) - 2 freq bee-heidit (7) - 1 freq hous-heid (7) - 1 freq rid-heidit (7) - 2 freq pig-heidit (7) - 1 freq hail-heidit (7) - 2 freq big-heidit (7) - 3 freq reid-heidit (7) - 5 freq dug-heidit (7) - 2 freq mony-heidit (7) - 1 freq hale-heidit (7) - 5 freq peerie-heedit (7) - 1 freq stufit-heidit (7) - 1 freq sappie-heidit (7) - 4 freq monie-leidit (7) - 1 freq baa-heidit (8) - 1 freq tattie-heids (8) - 1 freq |
SoundEx code - T233 tastit - 29 freq tasted - 20 freq tested - 21 freq thochtit - 2 freq tousie-heidit - 2 freq twisted - 24 freq twistit-an-an - 1 freq tastit- - 1 freq twistit - 38 freq toastit - 5 freq testit - 10 freq tichtit - 1 freq taistet - 1 freq texted - 4 freq twustit - 1 freq tax-dodgers - 1 freq tistet - 2 freq taisted- - 1 freq twistet - 3 freq tastet - 1 freq taistit - 1 freq tasted- - 1 freq thocht-oot - 1 freq thick-heided - 1 freq €œtwisted - 1 freq toasted - 3 freq twisteddoodles - 1 freq |
MetaPhone code - TSHTT tousie-heidit - 2 freq |
TOUSIE-HEIDIT |
Time to execute Levenshtein function - 0.246544 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.384610 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.027912 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.036867 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.000911 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. |