| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heistit (0) - 4 freq heisit (1) - 1 freq reistit (1) - 2 freq heistin (1) - 1 freq heystit (1) - 1 freq histit (1) - 1 freq hoistit (1) - 1 freq twistit (2) - 38 freq veisit (2) - 25 freq testit (2) - 10 freq foistit (2) - 1 freq heftit (2) - 5 freq heidit (2) - 60 freq ruistit (2) - 1 freq laistit (2) - 2 freq ristit (2) - 5 freq haitit (2) - 1 freq hechtit (2) - 5 freq reestit (2) - 11 freq existit (2) - 18 freq eistir (2) - 1 freq lestit (2) - 11 freq hiltit (2) - 1 freq veisitit (2) - 7 freq kistit (2) - 7 freq |
heistit (0) - 4 freq hoistit (1) - 1 freq heystit (1) - 1 freq histit (1) - 1 freq hystit (2) - 6 freq hostit (2) - 7 freq heisit (2) - 1 freq hoastit (2) - 11 freq heistin (2) - 1 freq reistit (2) - 2 freq hairstit (3) - 4 freq nestit (3) - 3 freq heistent (3) - 2 freq heist (3) - 8 freq waistit (3) - 4 freq hoistin (3) - 2 freq haistie (3) - 1 freq hettit (3) - 1 freq listit (3) - 7 freq ghaistit (3) - 1 freq chistit (3) - 2 freq vestit (3) - 1 freq mistit (3) - 1 freq taistit (3) - 1 freq jestit (3) - 1 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 |
HEISTIT |
| Time to execute Levenshtein function - 0.269175 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.381606 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.039281 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.037272 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.000922 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. |