| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hesitate (0) - 10 freq hesitated (1) - 11 freq hesitates (1) - 1 freq estate (2) - 88 freq hesitatin (2) - 4 freq eemitate (2) - 2 freq hesitatit (2) - 25 freq heritage (2) - 91 freq hesitant (2) - 5 freq meditate (2) - 6 freq heitath (2) - 1 freq designate (3) - 3 freq heedtae (3) - 1 freq hematite (3) - 1 freq destitute (3) - 2 freq 'state (3) - 2 freq situate (3) - 3 freq state (3) - 368 freq habitat (3) - 3 freq hostage (3) - 7 freq eemitates (3) - 1 freq irritate (3) - 1 freq imitate (3) - 4 freq delicate (3) - 21 freq dedicate (3) - 8 freq |
hesitate (0) - 10 freq hesitates (2) - 1 freq hesitated (2) - 11 freq hesitatit (3) - 25 freq estate (3) - 88 freq hesitatin (3) - 4 freq hesitant (3) - 5 freq heistit (4) - 4 freq habitat (4) - 3 freq heystit (4) - 1 freq hewitt (4) - 3 freq histit (4) - 1 freq hostit (4) - 7 freq state (4) - 368 freq hystit (4) - 6 freq hesitation (4) - 12 freq hostage (4) - 7 freq heitath (4) - 1 freq meditate (4) - 6 freq situate (4) - 3 freq heritage (4) - 91 freq eemitate (4) - 2 freq 'state (4) - 2 freq hematite (4) - 1 freq hestigeo (5) - 2 freq |
SoundEx code - H233 hesitatin - 4 freq heistit - 4 freq hoastit - 11 freq hesitation - 12 freq heich-heidit - 6 freq hesitate - 10 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 - HSTT heistit - 4 freq hoastit - 11 freq hesitate - 10 freq hostit - 7 freq histit - 1 freq hoistit - 1 freq hoasted - 7 freq hoisted - 3 freq hosted - 3 freq heystit - 1 freq hasted - 2 freq |
HESITATE |
| Time to execute Levenshtein function - 0.251905 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.441959 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.031652 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.040058 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.000982 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. |