| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norman (0) - 58 freq normans (1) - 3 freq norsman (1) - 1 freq worman (1) - 1 freq borman (1) - 1 freq no-man (1) - 2 freq normen (1) - 1 freq norma (1) - 2 freq forman (1) - 13 freq normal (1) - 133 freq norlan (1) - 21 freq gorman (1) - 1 freq norms (2) - 5 freq forgan (2) - 3 freq womman (2) - 1 freq mormin (2) - 2 freq hodman (2) - 1 freq coman (2) - 41 freq louman (2) - 1 freq norway (2) - 15 freq gormal (2) - 1 freq norrad (2) - 1 freq moran (2) - 8 freq newman (2) - 20 freq norlaun (2) - 1 freq |
norman (0) - 58 freq normen (1) - 1 freq norma (2) - 2 freq forman (2) - 13 freq gorman (2) - 1 freq normal (2) - 133 freq norlan (2) - 21 freq no-man (2) - 2 freq normans (2) - 3 freq norsman (2) - 1 freq worman (2) - 1 freq borman (2) - 1 freq norlin (3) - 171 freq doorman (3) - 2 freq nursan (3) - 3 freq ferman (3) - 1 freq formin (3) - 16 freq norton (3) - 3 freq herman (3) - 1 freq naaman (3) - 2 freq norn (3) - 34 freq german (3) - 160 freq roman (3) - 76 freq norln (3) - 1 freq harman (3) - 1 freq |
SoundEx code - N655 normans-' - 5 freq norman - 58 freq normandy - 3 freq narrae-mindit - 1 freq norman's - 7 freq normen - 1 freq normandie - 1 freq norman'll - 1 freq normans - 3 freq no-roman - 1 freq normanmurray - 5 freq |
MetaPhone code - NRMN norman - 58 freq normen - 1 freq no-roman - 1 freq |
NORMAN |
| Time to execute Levenshtein function - 0.370243 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.511527 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.026961 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.080338 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.001246 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. |