| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| november (0) - 86 freq novemmer (1) - 7 freq novemer (1) - 1 freq novembar (1) - 1 freq 'novemmer (2) - 1 freq neeber (3) - 2 freq number (3) - 174 freq nuremberg (3) - 2 freq comber (3) - 2 freq €˜member (3) - 2 freq novemmer's (3) - 1 freq member (3) - 75 freq remember (3) - 191 freq ramember (3) - 2 freq bomber (3) - 3 freq dizember (3) - 2 freq december (3) - 56 freq dezember (3) - 4 freq naemer (3) - 3 freq novelle (3) - 4 freq newer (4) - 7 freq nerrer (4) - 2 freq hover (4) - 9 freq forebear (4) - 3 freq love-bug (4) - 1 freq |
november (0) - 86 freq novembar (1) - 1 freq novemer (2) - 1 freq novemmer (2) - 7 freq number (4) - 174 freq 'novemmer (4) - 1 freq december (5) - 56 freq bomber (5) - 3 freq dezember (5) - 4 freq naemer (5) - 3 freq nhmbr (5) - 1 freq ramember (5) - 2 freq dizember (5) - 2 freq remember (5) - 191 freq neeber (5) - 2 freq nuremberg (5) - 2 freq comber (5) - 2 freq member (5) - 75 freq numbed (6) - 4 freq nebbery (6) - 1 freq niver (6) - 851 freq ootnumber (6) - 2 freq €˜amber (6) - 1 freq ombr (6) - 1 freq bamber (6) - 2 freq |
SoundEx code - N151 novembar - 1 freq november - 86 freq nip-nebs - 2 freq nipnebs - 5 freq naepumpkinsallowed - 1 freq |
MetaPhone code - NFMR novembar - 1 freq november - 86 freq novemmer - 7 freq novemer - 1 freq 'novemmer - 1 freq |
NOVEMBER |
| Time to execute Levenshtein function - 0.307313 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.463944 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.027273 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.072239 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.001121 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. |