| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newerday (0) - 1 freq ne'erday (1) - 6 freq newerdy (1) - 6 freq seterday (2) - 10 freq everday (2) - 2 freq weekday (3) - 3 freq neteral (3) - 1 freq weeterday (3) - 1 freq wedesday (3) - 1 freq never-aa (3) - 1 freq yestrday (3) - 1 freq needa (3) - 1 freq owerlay (3) - 1 freq everyday (3) - 32 freq nevermar (3) - 1 freq nevermas (3) - 5 freq seturday (3) - 29 freq yesterday (3) - 135 freq owerdae (3) - 1 freq newer (3) - 7 freq needly (3) - 4 freq needan (3) - 14 freq needty (3) - 1 freq eeday (3) - 1 freq setterday (3) - 114 freq |
newerday (0) - 1 freq newerdy (1) - 6 freq ne'erday (2) - 6 freq owerdae (4) - 1 freq everday (4) - 2 freq seterday (4) - 10 freq newer (4) - 7 freq newsed (5) - 6 freq wirdy (5) - 1 freq weirdy (5) - 1 freq wordy (5) - 11 freq neerly (5) - 1 freq neruda (5) - 1 freq nerd (5) - 2 freq seward (5) - 2 freq newark (5) - 1 freq inwardly (5) - 1 freq newmade (5) - 1 freq nuwara (5) - 2 freq aweready (5) - 3 freq reward (5) - 47 freq onward (5) - 5 freq weerd (5) - 1 freq needae (5) - 1 freq owerdue (5) - 3 freq |
SoundEx code - N630 north - 402 freq neruda - 1 freq nairriet - 1 freq ne'erday - 6 freq newerday - 1 freq norrad - 1 freq nard - 3 freq narrowed - 5 freq noarth - 23 freq nairret - 4 freq nort - 53 freq narrate - 3 freq nirt - 1 freq nord - 1 freq narra'd - 1 freq noerth - 1 freq nairth' - 2 freq neared - 3 freq naard - 1 freq naerraed - 1 freq nairth - 1 freq norat - 1 freq narrete - 1 freq narraed - 1 freq nerrowed - 1 freq near-white - 1 freq nerd - 2 freq nairraed - 2 freq newerdy - 6 freq |
MetaPhone code - NWRT newerday - 1 freq newerdy - 6 freq |
NEWERDAY |
| Time to execute Levenshtein function - 0.205964 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.375322 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.028373 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.039655 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.000934 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. |