| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norlin (0) - 171 freq norlins (1) - 1 freq yorlin (1) - 12 freq norln (1) - 1 freq norlan (1) - 21 freq nursin (2) - 29 freq norrie (2) - 20 freq holin (2) - 2 freq berlin (2) - 14 freq furlin (2) - 15 freq yorlins (2) - 3 freq roslin (2) - 1 freq dirlin (2) - 45 freq snorlie (2) - 1 freq colin (2) - 63 freq nohin (2) - 1 freq wordin (2) - 3 freq strlin (2) - 1 freq roilin (2) - 1 freq nottin (2) - 2 freq nonin (2) - 1 freq forkin (2) - 7 freq goblin (2) - 9 freq derlin (2) - 1 freq borrin (2) - 1 freq |
norlin (0) - 171 freq norln (1) - 1 freq norlan (1) - 21 freq norlins (2) - 1 freq yorlin (2) - 12 freq norlaun (2) - 1 freq norman (3) - 58 freq burlin (3) - 8 freq norland (3) - 9 freq hurlin (3) - 21 freq harlin (3) - 3 freq curlin (3) - 17 freq norton (3) - 3 freq snarlin (3) - 9 freq tirlin (3) - 13 freq mirlin (3) - 3 freq norn (3) - 34 freq merlin (3) - 6 freq norlans (3) - 1 freq purlin (3) - 1 freq carlin (3) - 6 freq hirlin (3) - 1 freq pirlin (3) - 8 freq gurlin (3) - 4 freq normen (3) - 1 freq |
SoundEx code - N645 nearlins - 6 freq norlan - 21 freq norlauns - 5 freq norlaun - 1 freq norlans - 1 freq norlin - 171 freq norln - 1 freq norland - 9 freq norlins - 1 freq neurolinguistic - 1 freq nrhlhnwoys - 1 freq |
MetaPhone code - NRLN norlan - 21 freq norlaun - 1 freq norlin - 171 freq norln - 1 freq |
NORLIN |
| Time to execute Levenshtein function - 0.208176 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.342414 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.030102 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.037812 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.000918 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. |