| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nfustweets (0) - 1 freq nfutweets (1) - 1 freq pruetweets (3) - 3 freq rcstweets (3) - 1 freq steets (4) - 1 freq trustees (4) - 1 freq retweets (4) - 3 freq futrets (4) - 2 freq sweets (4) - 12 freq neistweys (4) - 1 freq tweets (4) - 56 freq furthsets (4) - 1 freq streets (4) - 178 freq sterts (5) - 65 freq teets (5) - 2 freq leastwyes (5) - 1 freq €˜tweet (5) - 1 freq steeks (5) - 6 freq pgtwweets (5) - 7 freq sweet' (5) - 1 freq nutrients (5) - 5 freq nusiret (5) - 37 freq yestreens (5) - 1 freq fuskee (5) - 2 freq laestwyes (5) - 4 freq |
nfustweets (0) - 1 freq nfutweets (2) - 1 freq rcstweets (5) - 1 freq pruetweets (6) - 3 freq neistweys (6) - 1 freq tweets (7) - 56 freq streets (7) - 178 freq sweets (7) - 12 freq retweets (7) - 3 freq steets (7) - 1 freq futrets (7) - 2 freq laestweys (8) - 13 freq newsagents (8) - 4 freq fastest (8) - 14 freq infestit (8) - 3 freq leistweys (8) - 1 freq leastweys (8) - 11 freq nutties (8) - 1 freq infuses (8) - 1 freq sweits (8) - 2 freq fishnets (8) - 2 freq unsteeks (8) - 1 freq festers (8) - 1 freq infeftments (8) - 1 freq festent (8) - 1 freq |
SoundEx code - N123 navigation - 3 freq new-bocht - 2 freq navigate - 7 freq navigatin - 2 freq neep-shed - 1 freq 'navigate' - 1 freq nbeist - 1 freq navachitta - 12 freq navachitta's - 1 freq navigatour - 1 freq navigator - 1 freq newbiggit - 1 freq nbsjtfw - 1 freq nfegwdt - 1 freq npjt - 1 freq naefestivals - 1 freq nfustweets - 1 freq niupxzodx - 1 freq npqtpz - 1 freq nvwxtssdbe - 1 freq nfxt - 1 freq |
MetaPhone code - NFSTWTS nfustweets - 1 freq |
NFUSTWEETS |
| Time to execute Levenshtein function - 0.210843 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.364972 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.028156 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.037980 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.000841 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. |