| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hostit (0) - 7 freq postit (1) - 13 freq hoastit (1) - 11 freq costit (1) - 3 freq hootit (1) - 2 freq histit (1) - 1 freq hottit (1) - 1 freq hostin (1) - 16 freq rostit (1) - 1 freq hoistit (1) - 1 freq hystit (1) - 6 freq bootit (2) - 2 freq bustit (2) - 2 freq tostin (2) - 1 freq hostel (2) - 14 freq fosti (2) - 1 freq hostile (2) - 13 freq nestit (2) - 3 freq rostin (2) - 2 freq hiftit (2) - 1 freq positit (2) - 1 freq heftit (2) - 5 freq boltit (2) - 4 freq optit (2) - 1 freq hockit (2) - 3 freq |
hostit (0) - 7 freq hystit (1) - 6 freq histit (1) - 1 freq hoistit (1) - 1 freq hoastit (1) - 11 freq hootit (2) - 2 freq heistit (2) - 4 freq heystit (2) - 1 freq rostit (2) - 1 freq costit (2) - 3 freq hottit (2) - 1 freq hostin (2) - 16 freq postit (2) - 13 freq toastit (3) - 5 freq lastit (3) - 13 freq hautit (3) - 2 freq vestit (3) - 1 freq foostit (3) - 1 freq haitit (3) - 1 freq dustit (3) - 5 freq boastit (3) - 1 freq heatit (3) - 2 freq hastie (3) - 1 freq ristit (3) - 5 freq listit (3) - 7 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 |
HOSTIT |
| Time to execute Levenshtein function - 0.175421 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.349879 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.027659 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.039357 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.000948 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. |