| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tweeting (0) - 6 freq tweetin (1) - 20 freq teetin (2) - 10 freq weeping (2) - 3 freq twiting (2) - 1 freq sweeing (2) - 1 freq sweeping (2) - 4 freq weeding (2) - 1 freq sweating (2) - 2 freq tweetlin (2) - 2 freq weering (2) - 2 freq sweeming (2) - 1 freq tweetit (2) - 2 freq treating (2) - 3 freq tenting (2) - 1 freq greeting (2) - 13 freq retweeting (2) - 1 freq teeming (2) - 1 freq weetin (2) - 2 freq meeting (2) - 41 freq sweetin (2) - 3 freq testing (2) - 12 freq fleeting (2) - 2 freq tweelin (2) - 2 freq texting (2) - 1 freq |
tweeting (0) - 6 freq twiting (2) - 1 freq tweetin (2) - 20 freq sweating (3) - 2 freq treating (3) - 3 freq tenting (3) - 1 freq twisting (3) - 1 freq retweeting (3) - 1 freq testing (3) - 12 freq texting (3) - 1 freq tweelin (4) - 2 freq fleeting (4) - 2 freq tasting (4) - 5 freq toting (4) - 1 freq towering (4) - 2 freq waiting (4) - 49 freq toasting (4) - 3 freq touting (4) - 1 freq awaiting (4) - 2 freq sweetin (4) - 3 freq meeting (4) - 41 freq weering (4) - 2 freq tweetlin (4) - 2 freq weeping (4) - 3 freq sweeping (4) - 4 freq |
SoundEx code - T352 tutankhamun - 1 freq titanic - 27 freq titans - 1 freq tidins - 8 freq tiding - 1 freq twatimes - 1 freq twa-times - 5 freq twa-tumes - 1 freq tay-things - 1 freq tidiness - 1 freq titanic' - 1 freq titnes - 1 freq tithonus - 1 freq tetanus - 1 freq tattie-masher - 1 freq teathings - 1 freq totems - 3 freq tittensor - 1 freq toting - 1 freq totemism - 1 freq thewitnessfortheprosecution - 1 freq thedons - 1 freq tweeting - 6 freq twiting - 1 freq thetimes - 6 freq thetimesscot - 6 freq touting - 1 freq thethingsyousee - 1 freq |
MetaPhone code - TWTNK tweeting - 6 freq twiting - 1 freq |
TWEETING |
| Time to execute Levenshtein function - 0.404201 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.703579 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.080250 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.090784 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.000859 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. |