Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hesitatin (0) - 4 freq hesitatit (1) - 25 freq hesitation (1) - 12 freq hesitatin' (1) - 1 freq hesitates (2) - 1 freq hesitated (2) - 11 freq hesitate (2) - 9 freq eemitatin (2) - 1 freq meditatin (2) - 4 freq emittin (3) - 1 freq hesitant (3) - 5 freq habitation (3) - 6 freq resistin (3) - 1 freq recitation (3) - 2 freq dedicatin (3) - 2 freq hesitantly (3) - 1 freq meditation (3) - 12 freq bbsittin (3) - 1 freq gestation (3) - 1 freq visitation (3) - 1 freq devistatin (3) - 1 freq statin (3) - 12 freq resonatin (3) - 1 freq irritatin (3) - 4 freq estatis (3) - 1 freq |
hesitatin (0) - 4 freq hesitation (1) - 12 freq hesitatin' (2) - 1 freq hesitatit (2) - 25 freq hesitate (3) - 9 freq hesitated (3) - 11 freq hesitates (3) - 1 freq besettin (4) - 1 freq visitation (4) - 1 freq veesitation (4) - 1 freq statin (4) - 12 freq sittin (4) - 721 freq gestation (4) - 1 freq hittin (4) - 35 freq resettin (4) - 1 freq heistin (4) - 1 freq eemitatin (4) - 1 freq meditatin (4) - 4 freq habitation (4) - 6 freq sittan (5) - 32 freq seituation (5) - 6 freq hustlin (5) - 1 freq seitiation (5) - 3 freq besotten (5) - 1 freq upsitten (5) - 1 freq |
SoundEx code - H233 hesitatin - 4 freq heistit - 4 freq hoastit - 11 freq hesitation - 12 freq heich-heidit - 6 freq hesitate - 9 freq hesitatit - 25 freq hesitated - 11 freq hostit - 7 freq hesitatin' - 1 freq histit - 1 freq hoistit - 1 freq hystit - 6 freq hoasted - 7 freq hoisted - 3 freq hosted - 3 freq hechtit - 5 freq hysted - 3 freq heystit - 1 freq hesitatingly - 1 freq hasted - 2 freq hesitates - 1 freq hichtit - 1 freq |
MetaPhone code - HSTTN hesitatin - 4 freq hesitatin' - 1 freq |
HESITATIN |
Time to execute Levenshtein function - 0.247302 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.437021 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.027871 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.046724 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.000806 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. |