| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norlan (0) - 21 freq norland (1) - 9 freq norman (1) - 58 freq norlin (1) - 171 freq norlans (1) - 1 freq norlaun (1) - 1 freq norln (1) - 1 freq boilan (2) - 1 freq normal (2) - 133 freq normans (2) - 3 freq ootlan (2) - 1 freq no-man (2) - 2 freq borman (2) - 1 freq birlan (2) - 18 freq moran (2) - 8 freq hoolan (2) - 1 freq forran (2) - 1 freq morgan (2) - 37 freq howlan (2) - 11 freq forgan (2) - 3 freq norway (2) - 15 freq boran (2) - 2 freq sortan (2) - 1 freq toilan (2) - 1 freq hurlan (2) - 4 freq |
norlan (0) - 21 freq norlaun (1) - 1 freq norlin (1) - 171 freq norln (1) - 1 freq norlans (2) - 1 freq norland (2) - 9 freq norman (2) - 58 freq norlins (3) - 1 freq yorlin (3) - 12 freq norn (3) - 34 freq nursan (3) - 3 freq tarlan (3) - 4 freq nyowlan (3) - 1 freq normen (3) - 1 freq airlan (3) - 174 freq norton (3) - 3 freq roilan (3) - 1 freq hurlan (3) - 4 freq dirlan (3) - 3 freq curlan (3) - 2 freq tirlan (3) - 5 freq norlauns (3) - 5 freq birlan (3) - 18 freq reelan (4) - 3 freq nylon (4) - 4 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 |
NORLAN |
| Time to execute Levenshtein function - 0.186136 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.372479 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.027929 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.037626 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.000904 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. |