| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hesitate (0) - 9 freq hesitates (1) - 1 freq hesitated (1) - 11 freq heitath (2) - 1 freq hesitatin (2) - 4 freq heritage (2) - 90 freq estate (2) - 88 freq hesitant (2) - 5 freq hesitatit (2) - 25 freq eemitate (2) - 2 freq meditate (2) - 6 freq €˜estate (3) - 1 freq resisat (3) - 1 freq delicate (3) - 21 freq estimate (3) - 4 freq hesnae (3) - 1 freq hostage (3) - 7 freq hematite (3) - 1 freq situate (3) - 3 freq state (3) - 359 freq hermitage (3) - 6 freq eestae (3) - 3 freq 'state (3) - 2 freq desolate (3) - 3 freq irritate (3) - 1 freq |
hesitate (0) - 9 freq hesitated (2) - 11 freq hesitates (2) - 1 freq hesitant (3) - 5 freq estate (3) - 88 freq hesitatit (3) - 25 freq hesitatin (3) - 4 freq habitat (4) - 3 freq 'state (4) - 2 freq state (4) - 359 freq hesitation (4) - 12 freq hystit (4) - 6 freq hewitt (4) - 3 freq situate (4) - 3 freq hostit (4) - 7 freq heystit (4) - 1 freq histit (4) - 1 freq heistit (4) - 4 freq meditate (4) - 6 freq heitath (4) - 1 freq heritage (4) - 90 freq eemitate (4) - 2 freq hostage (4) - 7 freq hematite (4) - 1 freq stite (5) - 2 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 - HSTT heistit - 4 freq hoastit - 11 freq hesitate - 9 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.196349 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.335695 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.027157 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.036760 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.000841 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. |