| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| retweeted (0) - 5 freq tweeted (2) - 8 freq retweetin (2) - 2 freq retweets (2) - 3 freq retweet (2) - 12 freq repented (3) - 1 freq rtweetie (3) - 2 freq reeseeved (3) - 1 freq rejected (3) - 7 freq refected (3) - 1 freq reeted (3) - 4 freq retreaded (3) - 1 freq requested (3) - 4 freq reverted (3) - 1 freq recleeved (3) - 1 freq rethered (3) - 1 freq redeemed (3) - 5 freq relented (3) - 4 freq regretted (3) - 4 freq retorted (3) - 5 freq resented (3) - 1 freq reflected (3) - 11 freq weeted (3) - 1 freq reteired (3) - 3 freq respected (3) - 11 freq |
retweeted (0) - 5 freq retweet (3) - 12 freq retweets (3) - 3 freq retweetin (3) - 2 freq tweeted (3) - 8 freq tweated (4) - 1 freq retorted (4) - 5 freq rtweetie (4) - 2 freq repeated (5) - 32 freq tweeter (5) - 2 freq sweeted (5) - 1 freq repented (5) - 1 freq reteired (5) - 3 freq tweetled (5) - 1 freq retweeting (5) - 1 freq rutted (5) - 1 freq retrieved (5) - 3 freq detested (5) - 1 freq teeted (5) - 1 freq rowted (5) - 1 freq weeted (5) - 1 freq refected (5) - 1 freq rethered (5) - 1 freq resented (5) - 1 freq reverted (5) - 1 freq |
SoundEx code - R333 rat-a-tat - 7 freq rid-heidit - 2 freq reid-heided - 2 freq rat-a-tat-tattin - 1 freq reed-heidit - 1 freq radiated - 1 freq rid-heiddit - 2 freq reid-heidit - 5 freq retweeted - 5 freq rootatooed - 1 freq |
MetaPhone code - RTWTT retweeted - 5 freq |
RETWEETED |
| Time to execute Levenshtein function - 0.182222 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.394952 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.027082 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.039431 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.000990 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. |