| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nelson (0) - 8 freq neeson (1) - 1 freq neilson (1) - 11 freq wilson (2) - 48 freq ellon (2) - 19 freq petson (2) - 1 freq neocon (2) - 1 freq eldon (2) - 1 freq benson (2) - 1 freq lesson (2) - 108 freq season (2) - 118 freq elton (2) - 2 freq newsin (2) - 29 freq wulson (2) - 8 freq newsan (2) - 2 freq alson (2) - 1 freq nylon (2) - 4 freq neilsons (2) - 1 freq esson (2) - 1 freq leason (2) - 1 freq kelso (2) - 2 freq neon (2) - 7 freq melton (2) - 1 freq newton (2) - 19 freq felon (2) - 2 freq |
nelson (0) - 8 freq neilson (1) - 11 freq neeson (2) - 1 freq newsan (3) - 2 freq wulson (3) - 8 freq nylon (3) - 4 freq leason (3) - 1 freq newsin (3) - 29 freq neilsons (3) - 1 freq alson (3) - 1 freq wilson (3) - 48 freq ailison (4) - 1 freq nals (4) - 1 freq nursin (4) - 29 freq coulson (4) - 2 freq alison (4) - 410 freq nosn (4) - 1 freq unreason (4) - 1 freq noisin (4) - 2 freq elision (4) - 2 freq analysin (4) - 1 freq nclusion (4) - 1 freq nosin (4) - 2 freq unison (4) - 8 freq nls (4) - 6 freq |
SoundEx code - N425 neilson - 11 freq nelson - 8 freq neilsimmy - 3 freq naeyellasnawken - 1 freq nelckno - 1 freq neilsons - 1 freq |
MetaPhone code - NLSN neilson - 11 freq nelson - 8 freq |
NELSON |
| Time to execute Levenshtein function - 0.285081 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.801103 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.030336 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.098371 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.001283 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. |