| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newerdy (0) - 6 freq newerday (1) - 1 freq neerly (2) - 1 freq ne'erday (2) - 6 freq needy (2) - 7 freq newer (2) - 7 freq everday (3) - 2 freq seedy (3) - 1 freq sewed (3) - 1 freq remedy (3) - 4 freq eery (3) - 2 freq nerd (3) - 2 freq peerly (3) - 1 freq niwer (3) - 28 freq every (3) - 822 freq nswer (3) - 1 freq nebbery (3) - 1 freq owerby (3) - 9 freq nervy (3) - 5 freq neer (3) - 51 freq nearly (3) - 289 freq neebody (3) - 1 freq needs (3) - 340 freq rewards (3) - 6 freq wordy (3) - 11 freq |
newerdy (0) - 6 freq newerday (1) - 1 freq newer (3) - 7 freq ne'erday (3) - 6 freq wirdy (4) - 1 freq seward (4) - 2 freq onward (4) - 5 freq werd (4) - 1 freq swerd (4) - 1 freq reward (4) - 47 freq newark (4) - 1 freq niwer (4) - 28 freq weerd (4) - 1 freq wordy (4) - 11 freq newmade (4) - 1 freq nerd (4) - 2 freq inward (4) - 7 freq needy (4) - 7 freq neerly (4) - 1 freq newsed (4) - 6 freq weirdy (4) - 1 freq swurd (5) - 5 freq werds (5) - 1 freq sawrd (5) - 1 freq atward (5) - 1 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 |
NEWERDY |
| Time to execute Levenshtein function - 0.212451 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.425308 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.034018 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.078181 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.001009 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. |