| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nfutweets (0) - 1 freq nfustweets (1) - 1 freq futrets (3) - 2 freq rcstweets (3) - 1 freq pruetweets (3) - 3 freq tweets (3) - 56 freq retweets (3) - 3 freq future's (4) - 5 freq streets (4) - 178 freq nutrients (4) - 5 freq nutties (4) - 1 freq theets (4) - 1 freq fotees (4) - 3 freq pgtwweets (4) - 7 freq futrats (4) - 1 freq retweet (4) - 12 freq tweeds (4) - 3 freq nutters (4) - 7 freq f-teeth (4) - 1 freq weets (4) - 1 freq cutlets (4) - 3 freq outlets (4) - 1 freq sweets (4) - 12 freq futtret (4) - 1 freq fleets (4) - 3 freq |
nfutweets (0) - 1 freq nfustweets (2) - 1 freq pruetweets (5) - 3 freq tweets (5) - 56 freq futrets (5) - 2 freq retweets (5) - 3 freq nutties (6) - 1 freq futrats (6) - 1 freq rcstweets (6) - 1 freq futret (7) - 7 freq intents (7) - 2 freq neets (7) - 1 freq tweests (7) - 1 freq twats (7) - 2 freq teets (7) - 2 freq tweet (7) - 100 freq €˜tweet (7) - 1 freq futures (7) - 8 freq newts (7) - 1 freq notts (7) - 20 freq fatties (7) - 1 freq twits (7) - 1 freq infects (7) - 1 freq neistweys (7) - 1 freq nutmegs (7) - 1 freq |
SoundEx code - N133 naebody'd - 6 freq ïnvitit - 2 freq neepheidit - 1 freq nfutweets - 1 freq |
MetaPhone code - NFTWTS nfutweets - 1 freq |
NFUTWEETS |
| Time to execute Levenshtein function - 0.288138 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.634589 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.082967 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.063245 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.002760 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. |