| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hashtag (0) - 7 freq hashtags (1) - 2 freq hashter (2) - 4 freq hashing (2) - 2 freq gasbag (3) - 1 freq vashti (3) - 2 freq dasht (3) - 1 freq ashton (3) - 4 freq dashan (3) - 1 freq hasher (3) - 1 freq lashan (3) - 1 freq hashie (3) - 2 freq haste (3) - 37 freq haslam (3) - 1 freq hasted (3) - 2 freq hast (3) - 2 freq washan (3) - 3 freq hasna (3) - 29 freq dashcam (3) - 1 freq tasht (3) - 1 freq hostage (3) - 7 freq pastas (3) - 1 freq ashak (3) - 1 freq hauntan (3) - 1 freq ashram (3) - 6 freq |
hashtag (0) - 7 freq hashtags (2) - 2 freq hashing (3) - 2 freq hashter (3) - 4 freq hostage (4) - 7 freq stag (5) - 49 freq hishan (5) - 1 freq hastie (5) - 1 freq 'stag (5) - 1 freq hashed (5) - 4 freq ashtray (5) - 7 freq shag (5) - 14 freq hashin (5) - 2 freq fasht (5) - 61 freq washte (5) - 1 freq hasten (5) - 1 freq hashtag-ad (5) - 1 freq cashing (5) - 1 freq hasthe (5) - 1 freq dashing (5) - 4 freq lashing (5) - 1 freq lasheg (5) - 1 freq hash (5) - 25 freq washing (5) - 22 freq wastage (5) - 3 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 - HXTK hashtag - 7 freq |
HASHTAG |
| Time to execute Levenshtein function - 0.222691 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.339172 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.028352 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.036587 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.000809 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. |