| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| novemmer (0) - 7 freq 'novemmer (1) - 1 freq novemer (1) - 1 freq november (1) - 86 freq novembar (2) - 1 freq novemmer's (2) - 1 freq govermen (3) - 2 freq bremmer (3) - 1 freq rememmer (3) - 1 freq memmer (3) - 35 freq nummer (3) - 336 freq €˜memmer (3) - 1 freq naemer (3) - 3 freq nummmer (3) - 1 freq nevermar (3) - 1 freq hemmer (3) - 21 freq nemmes (3) - 10 freq vimmer (3) - 3 freq nemme (3) - 9 freq novelle (3) - 4 freq gemmer (3) - 1 freq decemmer (3) - 1 freq hemmed (4) - 3 freq former (4) - 38 freq plummer (4) - 1 freq |
novemmer (0) - 7 freq novemer (2) - 1 freq november (2) - 86 freq 'novemmer (2) - 1 freq novembar (3) - 1 freq nummer (4) - 336 freq nevermar (4) - 1 freq vimmer (4) - 3 freq novemmer's (4) - 1 freq nummmer (4) - 1 freq nemme (5) - 9 freq nivermore (5) - 1 freq intimmer (5) - 1 freq nummur (5) - 1 freq nevermore (5) - 1 freq decemmer (5) - 1 freq gemmer (5) - 1 freq nemmes (5) - 10 freq bremmer (5) - 1 freq memmer (5) - 35 freq nivermair (5) - 1 freq rememmer (5) - 1 freq nvmm (5) - 1 freq hemmer (5) - 21 freq naemer (5) - 3 freq |
SoundEx code - N156 novemmer - 7 freq novemmer's - 1 freq novemer - 1 freq 'novemmer - 1 freq |
MetaPhone code - NFMR novembar - 1 freq november - 86 freq novemmer - 7 freq novemer - 1 freq 'novemmer - 1 freq |
NOVEMMER |
| Time to execute Levenshtein function - 0.273431 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.762321 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.027930 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.085705 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.000812 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. |