Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
heirskip (0) - 185 freq heirskeip (1) - 96 freq herskip (1) - 1 freq heirship (1) - 6 freq heirskeips (2) - 1 freq heidship (2) - 1 freq heirschip (2) - 1 freq freinskip (3) - 1 freq heirin (3) - 2 freq deerskin (3) - 1 freq herkin (3) - 3 freq hairdship (3) - 1 freq nirski (3) - 3 freq hairstin (3) - 14 freq haurdskip (3) - 1 freq heidschip (3) - 1 freq heisk (3) - 1 freq wirship (3) - 10 freq hearkin (3) - 1 freq heisit (3) - 1 freq hairstit (3) - 4 freq herkit (3) - 1 freq meirakil (3) - 4 freq heistit (3) - 4 freq heistin (3) - 1 freq |
heirskip (0) - 185 freq herskip (1) - 1 freq heirskeip (1) - 96 freq heirship (2) - 6 freq heirskeips (3) - 1 freq haurdskip (4) - 1 freq heidship (4) - 1 freq heirschip (4) - 1 freq hearkin (5) - 1 freq hairstit (5) - 4 freq wirship (5) - 10 freq hirslin (5) - 2 freq heisk (5) - 1 freq heirs (5) - 7 freq horsikie (5) - 1 freq herkit (5) - 1 freq nirski (5) - 3 freq deerskin (5) - 1 freq harsk (5) - 3 freq freinskip (5) - 1 freq herkin (5) - 3 freq hairdship (5) - 1 freq hairstin (5) - 14 freq wurship (6) - 1 freq lanskip (6) - 1 freq |
SoundEx code - H621 heirship - 6 freq horseflesh - 1 freq horseback - 11 freq heirschip - 1 freq heirskip - 185 freq here'safew - 1 freq horoscope - 1 freq hairspray - 4 freq horoscopes - 1 freq horsbroch - 10 freq horse-box - 1 freq hairsbreadth - 1 freq horoscope's - 1 freq heirskeip - 96 freq heirskeips - 1 freq horsburgh - 2 freq horseflee - 1 freq horsefaal - 11 freq horsefadl - 1 freq horseplay - 1 freq horssbressis - 1 freq heirschippis - 1 freq herskip - 1 freq hersef - 1 freq harrygowbakery - 2 freq |
MetaPhone code - HRSKP heirskip - 185 freq horoscope - 1 freq heirskeip - 96 freq herskip - 1 freq |
HEIRSKIP |
Time to execute Levenshtein function - 0.225021 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.504983 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.029473 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.075094 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.000856 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. |