| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoasted (0) - 7 freq hosted (1) - 3 freq hasted (1) - 2 freq hoisted (1) - 3 freq coasted (1) - 1 freq roasted (1) - 5 freq boasted (1) - 1 freq toasted (1) - 3 freq hoased (1) - 1 freq foisted (2) - 1 freq hoast' (2) - 1 freq boosted (2) - 1 freq halted (2) - 2 freq hanted (2) - 2 freq roaster (2) - 17 freq haeted (2) - 1 freq hysted (2) - 3 freq soarted (2) - 1 freq hated (2) - 48 freq hoastit (2) - 11 freq rowsted (2) - 6 freq coated (2) - 4 freq noosted (2) - 1 freq doated (2) - 1 freq hoosed (2) - 6 freq |
hoasted (0) - 7 freq hosted (1) - 3 freq hoisted (1) - 3 freq hasted (1) - 2 freq hysted (2) - 3 freq hoased (2) - 1 freq toasted (2) - 3 freq coasted (2) - 1 freq roasted (2) - 5 freq boasted (2) - 1 freq casted (3) - 2 freq pasted (3) - 2 freq hosed (3) - 1 freq tasted (3) - 20 freq lasted (3) - 15 freq hoastun (3) - 1 freq rousted (3) - 2 freq roosted (3) - 2 freq feasted (3) - 2 freq houster (3) - 1 freq heated (3) - 9 freq hoast (3) - 41 freq hoasts (3) - 8 freq hearted (3) - 5 freq hoastin (3) - 18 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 |
HOASTED |
| Time to execute Levenshtein function - 0.304412 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.532577 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.060570 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.036740 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.000798 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. |