| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retweets (0) - 3 freq retweet (1) - 12 freq retweeted (2) - 5 freq tweets (2) - 56 freq pruetweets (2) - 3 freq retweetin (2) - 2 freq rcstweets (2) - 1 freq retches (3) - 1 freq regrets (3) - 12 freq hewmets (3) - 1 freq meeneets (3) - 1 freq pretexts (3) - 2 freq requests (3) - 7 freq yet-eet's (3) - 1 freq retweeting (3) - 1 freq retorts (3) - 2 freq reets (3) - 16 freq retells (3) - 1 freq theets (3) - 1 freq tweeds (3) - 3 freq pgtwweets (3) - 7 freq decreets (3) - 2 freq remeens (3) - 1 freq rejects (3) - 1 freq relents (3) - 3 freq |
retweets (0) - 3 freq retweet (2) - 12 freq pruetweets (3) - 3 freq retweetin (3) - 2 freq tweets (3) - 56 freq retweeted (3) - 5 freq retorts (4) - 2 freq rtweetie (4) - 2 freq rcstweets (4) - 1 freq weets (5) - 1 freq retreat (5) - 26 freq resets (5) - 1 freq repeats (5) - 11 freq teets (5) - 2 freq detects (5) - 1 freq tweet (5) - 100 freq repents (5) - 2 freq nfutweets (5) - 1 freq rotates (5) - 2 freq ratties (5) - 2 freq twits (5) - 1 freq twats (5) - 2 freq sweets (5) - 12 freq streets (5) - 178 freq retiret (5) - 1 freq |
SoundEx code - R332 radiates - 3 freq reidheids - 1 freq rotates - 2 freq roidheids - 1 freq retweets - 3 freq readoutsignpost - 1 freq redditships - 1 freq |
MetaPhone code - RTWTS retweets - 3 freq |
RETWEETS |
| Time to execute Levenshtein function - 0.215818 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.395190 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.032594 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.045186 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.000880 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. |