| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norlins (0) - 1 freq yorlins (1) - 3 freq norlin (1) - 171 freq norlans (1) - 1 freq nothins (2) - 1 freq nyowlins (2) - 1 freq newlins (2) - 2 freq norlauns (2) - 5 freq gorblins (2) - 1 freq norln (2) - 1 freq perlins (2) - 3 freq norris (2) - 1 freq nories (2) - 25 freq normans (2) - 3 freq norland (2) - 9 freq darlins (2) - 4 freq lordlins (2) - 1 freq norries (2) - 5 freq codlins (2) - 4 freq norlan (2) - 21 freq noggins (2) - 2 freq derlins (2) - 1 freq yirlins (2) - 1 freq workins (2) - 4 freq nearlins (2) - 6 freq |
norlins (0) - 1 freq norlans (1) - 1 freq nearlins (2) - 6 freq yorlins (2) - 3 freq norlauns (2) - 5 freq norlin (2) - 171 freq yirlins (3) - 1 freq norlan (3) - 21 freq derlins (3) - 1 freq norns (3) - 7 freq birlins (3) - 1 freq yerlins (3) - 1 freq norland (3) - 9 freq darlins (3) - 4 freq normans (3) - 3 freq newlins (3) - 2 freq nyowlins (3) - 1 freq perlins (3) - 3 freq norln (3) - 1 freq collins (4) - 3 freq railins (4) - 22 freq barelins (4) - 1 freq forkins (4) - 1 freq carlines (4) - 3 freq nylons (4) - 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 - NRLNS nearlins - 6 freq norlauns - 5 freq norlans - 1 freq norlins - 1 freq |
NORLINS |
| Time to execute Levenshtein function - 0.215749 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.419981 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.061444 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.038413 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.001338 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. |