| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newcomer (0) - 5 freq newcomers (1) - 6 freq newcome's (2) - 1 freq welcomer (2) - 1 freq becomes (3) - 42 freq recover (3) - 7 freq owercomer (3) - 1 freq become (3) - 192 freq oercome (3) - 1 freq incomer (3) - 9 freq newer (3) - 7 freq welcome (3) - 167 freq welcome' (3) - 1 freq welcomet (3) - 1 freq welcomes (3) - 3 freq comer (3) - 4 freq newsmen (3) - 2 freq welcomed (3) - 15 freq bedcover (3) - 1 freq newspaper (4) - 62 freq nescafe (4) - 1 freq recowert (4) - 1 freq upcome (4) - 2 freq becomin (4) - 45 freq niwer (4) - 28 freq |
newcomer (0) - 5 freq newcomers (2) - 6 freq incomer (4) - 9 freq welcomer (4) - 1 freq newcome's (4) - 1 freq comer (5) - 4 freq newer (5) - 7 freq unweicome (5) - 1 freq newsmen (5) - 2 freq owercomer (5) - 1 freq newvir (6) - 6 freq nummer (6) - 336 freq unwelcome (6) - 7 freq income (6) - 15 freq nicker (6) - 1 freq oncome (6) - 40 freq naewher (6) - 4 freq swimmer (6) - 3 freq niwver (6) - 6 freq in-comers (6) - 1 freq newmade (6) - 1 freq nectar (6) - 9 freq pawcher (6) - 1 freq neccesar (6) - 1 freq incomers (6) - 13 freq |
SoundEx code - N256 newcomer - 5 freq nicgumaraid - 2 freq newcomers - 6 freq nsmrvx - 1 freq nicmharcuis - 1 freq nznrnqe - 1 freq naswinnerton - 3 freq nyjqsmr - 1 freq |
MetaPhone code - NKMR newcomer - 5 freq knockmair - 1 freq |
NEWCOMER |
| Time to execute Levenshtein function - 0.198019 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.354893 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.028486 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.038201 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.000880 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. |