| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hostess (0) - 2 freq hostels (1) - 1 freq hotness (2) - 1 freq hostesses (2) - 1 freq posters (2) - 30 freq hostel (2) - 14 freq hosted (2) - 3 freq hopless (2) - 1 freq hottest (2) - 4 freq hooters (2) - 3 freq hotels (2) - 9 freq ghosters (2) - 1 freq mostest (2) - 1 freq hoses (2) - 1 freq possess (2) - 11 freq hosts (2) - 13 freq assess (3) - 8 freq vastness (3) - 1 freq spess (3) - 1 freq photes (3) - 1 freq ghosts (3) - 23 freq rosie's (3) - 5 freq godless (3) - 12 freq boness (3) - 3 freq conters (3) - 1 freq |
hostess (0) - 2 freq hostels (2) - 1 freq hosts (3) - 13 freq hostesses (3) - 1 freq hostages (4) - 1 freq possess (4) - 11 freq hotses (4) - 1 freq mistiess (4) - 1 freq hisses (4) - 4 freq hertiess (4) - 1 freq hysts (4) - 1 freq hoses (4) - 1 freq hooseless (4) - 1 freq hoasts (4) - 8 freq mostest (4) - 1 freq hopless (4) - 1 freq hooters (4) - 3 freq posters (4) - 30 freq hotness (4) - 1 freq hostel (4) - 14 freq hotels (4) - 9 freq hottest (4) - 4 freq hosted (4) - 3 freq ghosters (4) - 1 freq costies (5) - 8 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 |
HOSTESS |
| Time to execute Levenshtein function - 0.307555 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.535716 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.062828 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.039299 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.000879 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. |