| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nbsjtfw (0) - 1 freq nbshow (3) - 10 freq sjtnw (3) - 1 freq nsfw (3) - 4 freq nestlt (4) - 1 freq nestin (4) - 3 freq bufw (4) - 1 freq bskkfv (4) - 1 freq nichtfa (4) - 2 freq sbscfq (4) - 1 freq nichtfaw (4) - 2 freq npjt (4) - 1 freq €˜stew (4) - 1 freq nxsjm (4) - 1 freq nestie (4) - 7 freq stow (4) - 7 freq nescafe (4) - 1 freq bestow (4) - 1 freq nestit (4) - 3 freq btf (4) - 8 freq oejtfk (4) - 1 freq kstew (4) - 1 freq bsqt (4) - 1 freq blcfw (4) - 1 freq nest (4) - 81 freq |
nbsjtfw (0) - 1 freq nsfw (6) - 4 freq sjtnw (6) - 1 freq nbshow (6) - 10 freq bestow (7) - 1 freq nsfwy (7) - 1 freq instaw (7) - 1 freq nichtfaw (7) - 2 freq sjw (8) - 1 freq gustfu (8) - 1 freq stew (8) - 51 freq nest- (8) - 1 freq btw (8) - 110 freq stw (8) - 43 freq mbtw (8) - 1 freq sjfc (8) - 1 freq nesty (8) - 38 freq nestis (8) - 1 freq borthw (8) - 2 freq fistfu (8) - 1 freq staw (8) - 10 freq nestan (8) - 1 freq njzf (8) - 7 freq nyatf (8) - 1 freq bestowe (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 - NBSJTF nbsjtfw - 1 freq |
NBSJTFW |
| Time to execute Levenshtein function - 0.227691 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.402351 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.030870 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.039694 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.000840 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. |