| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hosts (0) - 13 freq hoasts (1) - 8 freq posts (1) - 45 freq hoots (1) - 9 freq houts (1) - 1 freq ghosts (1) - 23 freq costs (1) - 45 freq hoss (1) - 1 freq hoses (1) - 1 freq hysts (1) - 1 freq host (1) - 35 freq hots (1) - 1 freq hesps (2) - 2 freq goats (2) - 17 freq monts (2) - 5 freq loses (2) - 6 freq hooks (2) - 16 freq hosea (2) - 1 freq forts (2) - 3 freq hilts (2) - 1 freq coots (2) - 1 freq ross (2) - 100 freq o'ts (2) - 2 freq hoys (2) - 2 freq moses (2) - 68 freq |
hosts (0) - 13 freq hoasts (1) - 8 freq hysts (1) - 1 freq host (2) - 35 freq hots (2) - 1 freq heests (2) - 2 freq heysts (2) - 1 freq hoses (2) - 1 freq hoots (2) - 9 freq posts (2) - 45 freq ghosts (2) - 23 freq houts (2) - 1 freq costs (2) - 45 freq hoss (2) - 1 freq houses (3) - 25 freq hosted (3) - 3 freq vests (3) - 4 freq boosts (3) - 1 freq hoast' (3) - 1 freq hasty (3) - 6 freq mists (3) - 8 freq hurts (3) - 16 freq hauts (3) - 1 freq lests (3) - 3 freq hostess (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 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 howzitgaun - 2 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 |
HOSTS |
| Time to execute Levenshtein function - 0.190690 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.365234 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.028301 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.039702 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.000960 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. |