Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nsyutdyp (0) - 1 freq unsturdy (4) - 1 freq sauty (4) - 6 freq shut-up (4) - 1 freq sturdy (4) - 27 freq sautty (4) - 1 freq scuddy (4) - 2 freq slundy (4) - 1 freq saundy (4) - 2 freq nobudy (4) - 1 freq sundup (4) - 3 freq soundy (4) - 1 freq nobuddy (4) - 1 freq study (4) - 114 freq nyummy (4) - 1 freq sumdys (4) - 1 freq sumdy (4) - 62 freq nutty (4) - 6 freq naybudy (4) - 2 freq stuiden (5) - 1 freq synod (5) - 1 freq sully (5) - 2 freq shady (5) - 7 freq insteidy (5) - 1 freq pluidy (5) - 1 freq |
nsyutdyp (0) - 1 freq sundup (6) - 3 freq ensteyd (6) - 2 freq insteidy (6) - 1 freq unsteady (6) - 3 freq study (6) - 114 freq unsteddy (6) - 1 freq unsturdy (6) - 1 freq nusnp (7) - 2 freq strip (7) - 59 freq studyin (7) - 39 freq steyd (7) - 9 freq wtdup (7) - 1 freq strap (7) - 10 freq nonstop (7) - 1 freq studs (7) - 6 freq stqp (7) - 1 freq nesty (7) - 38 freq nasty (7) - 27 freq steep (7) - 34 freq instaed (7) - 4 freq insteid (7) - 318 freq stoop (7) - 16 freq neestdoor (7) - 1 freq instid (7) - 2 freq |
SoundEx code - N231 nichtfaw - 2 freq nosedive - 1 freq negatively - 2 freq negativity - 7 freq nest-feitherin - 1 freq nest-featherin - 1 freq negative - 41 freq nocht-fiction - 3 freq nochtfiction - 1 freq nicht-flittins - 1 freq nichtfa - 2 freq nicht-faa - 1 freq 'nichtfa' - 1 freq €˜negative - 1 freq nichtbour - 2 freq nest-biggin - 1 freq negatives - 3 freq negitively - 1 freq nichtfaa - 2 freq neuk-o-the-back - 1 freq negativitiy's - 1 freq nickstoppani - 9 freq nsyutdyp - 1 freq nhsthebrave - 1 freq nctpehgy - 1 freq nyqtf - 1 freq |
MetaPhone code - NSYTTP nsyutdyp - 1 freq |
NSYUTDYP |
Time to execute Levenshtein function - 0.173530 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.368696 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.028270 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.037246 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.000859 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. |