Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
norma (0) - 2 freq nora (1) - 6 freq normal (1) - 130 freq korma (1) - 3 freq norwa (1) - 3 freq normo (1) - 1 freq norman (1) - 57 freq norm (1) - 10 freq norms (1) - 5 freq forms (2) - 110 freq o'ma (2) - 2 freq forman (2) - 13 freq foraa (2) - 1 freq nom (2) - 2 freq norrad (2) - 1 freq norat (2) - 1 freq lora (2) - 1 freq norln (2) - 1 freq no-man (2) - 2 freq gormal (2) - 1 freq fora (2) - 3 freq north (2) - 391 freq ormi (2) - 3 freq norns (2) - 7 freq nrm (2) - 3 freq |
norma (0) - 2 freq normo (1) - 1 freq norm (1) - 10 freq nrm (2) - 3 freq norman (2) - 57 freq enorm (2) - 11 freq norms (2) - 5 freq norwa (2) - 3 freq nora (2) - 6 freq korma (2) - 3 freq normal (2) - 130 freq wormy (3) - 1 freq norway (3) - 15 freq roma (3) - 1 freq prma (3) - 1 freq form (3) - 288 freq norie (3) - 46 freq karma (3) - 5 freq norse (3) - 53 freq norr (3) - 3 freq nord (3) - 1 freq worm (3) - 34 freq norge (3) - 1 freq nort (3) - 53 freq norn (3) - 34 freq |
SoundEx code - N650 nearhaun - 68 freq nearhan - 28 freq near-on - 2 freq nearin - 6 freq norm - 10 freq nairne - 2 freq near-haun - 5 freq norn' - 1 freq norn - 34 freq narrowin - 4 freq nearan - 1 freq nerr-haun - 1 freq nairn - 6 freq noarn - 1 freq narhaan - 1 freq naarhan - 17 freq neirhann - 1 freq norma - 2 freq €œnorm - 1 freq narnia - 1 freq normo - 1 freq nrm - 3 freq |
MetaPhone code - NRM norm - 10 freq norma - 2 freq €œnorm - 1 freq normo - 1 freq nrm - 3 freq |
NORMA |
Time to execute Levenshtein function - 0.200898 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.341594 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.027914 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.036374 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.000770 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. |