| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heysts (0) - 1 freq hysts (1) - 1 freq heests (1) - 2 freq hechts (2) - 3 freq vests (2) - 4 freq bests (2) - 2 freq hefts (2) - 39 freq neyts (2) - 5 freq feasts (2) - 5 freq herst (2) - 6 freq heats (2) - 3 freq nests (2) - 27 freq wheests (2) - 1 freq hosts (2) - 13 freq rests (2) - 11 freq jeists (2) - 3 freq hess (2) - 2 freq tests (2) - 28 freq trysts (2) - 8 freq hyste (2) - 9 freq heystit (2) - 1 freq chests (2) - 7 freq gests (2) - 2 freq jests (2) - 2 freq he'rts (2) - 4 freq |
heysts (0) - 1 freq hysts (1) - 1 freq heests (1) - 2 freq hoasts (2) - 8 freq hosts (2) - 13 freq jeests (3) - 7 freq beasts (3) - 144 freq hesps (3) - 2 freq jests (3) - 2 freq gests (3) - 2 freq herts (3) - 119 freq beists (3) - 2 freq pests (3) - 2 freq hearts (3) - 32 freq heist (3) - 8 freq hyst (3) - 5 freq reists (3) - 1 freq heest (3) - 1 freq chests (3) - 7 freq lests (3) - 3 freq kests (3) - 2 freq feasts (3) - 5 freq nests (3) - 27 freq hefts (3) - 39 freq bests (3) - 2 freq |
SoundEx code - H232 heichts - 11 freq hichts - 10 freq hechts - 3 freq hostage - 7 freq hoasts - 8 freq hosts - 13 freq hysts - 1 freq howzitgaun - 3 freq heights - 3 freq haystack - 2 freq hostess - 2 freq high-tech - 2 freq hechtsome - 1 freq hashtags - 2 freq hoosedug - 1 freq hestigeo - 2 freq heests - 2 freq hoggetscauf - 1 freq hashtag-ad - 1 freq hey-stack - 1 freq hoosehauds - 5 freq heysts - 1 freq hashtag - 7 freq heywechts - 2 freq hectic - 1 freq hgducrs - 1 freq hgtokpnr - 1 freq hugggggggsdss - 1 freq hostages - 1 freq hostesses - 1 freq hctko - 1 freq hktwkwqa - 1 freq howzitgoan - 10 freq hkzetswlvw - 1 freq hjtkb - 1 freq |
MetaPhone code - HSTS hoasts - 8 freq hosts - 13 freq hostess - 2 freq heests - 2 freq heysts - 1 freq |
HEYSTS |
| Time to execute Levenshtein function - 0.283216 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.633226 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.080589 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.087765 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.001224 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. |