| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hasted (0) - 2 freq pasted (1) - 2 freq hashed (1) - 4 freq casted (1) - 2 freq halted (1) - 2 freq hated (1) - 48 freq wasted (1) - 23 freq haste (1) - 37 freq lasted (1) - 15 freq hatted (1) - 1 freq hanted (1) - 2 freq hasten (1) - 1 freq hoasted (1) - 7 freq tasted (1) - 20 freq hysted (1) - 3 freq hosted (1) - 3 freq haeted (1) - 1 freq ganted (2) - 2 freq baste (2) - 8 freq shafted (2) - 7 freq hasthe (2) - 1 freq tastes (2) - 37 freq waster (2) - 13 freq whanted (2) - 4 freq boasted (2) - 1 freq |
hasted (0) - 2 freq hoasted (1) - 7 freq hosted (1) - 3 freq hysted (1) - 3 freq hanted (2) - 2 freq hasten (2) - 1 freq hoisted (2) - 3 freq tasted (2) - 20 freq hatted (2) - 1 freq haeted (2) - 1 freq casted (2) - 2 freq pasted (2) - 2 freq lasted (2) - 15 freq halted (2) - 2 freq hashed (2) - 4 freq haste (2) - 37 freq wasted (2) - 23 freq hated (2) - 48 freq rested (3) - 11 freq hushed (3) - 10 freq dusted (3) - 6 freq haitd (3) - 1 freq haister (3) - 2 freq waisted (3) - 1 freq hustled (3) - 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 - 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 |
HASTED |
| Time to execute Levenshtein function - 0.180100 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.335382 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.030000 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.036804 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.000812 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. |