| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nummers (0) - 107 freq summers (1) - 13 freq numbers (1) - 64 freq bummers (1) - 18 freq nummer's (1) - 2 freq nummer (1) - 336 freq nummert (1) - 4 freq bummer (2) - 21 freq emmers (2) - 4 freq summer (2) - 196 freq number (2) - 172 freq slummers (2) - 1 freq hummer (2) - 2 freq timmers (2) - 6 freq drummers (2) - 2 freq lumbers (2) - 3 freq hummels (2) - 1 freq tummlers (2) - 1 freq wummer (2) - 1 freq bummer's (2) - 2 freq cumers (2) - 1 freq limmers (2) - 3 freq rummels (2) - 2 freq gimmers (2) - 3 freq nutmegs (2) - 1 freq |
nummers (0) - 107 freq nummer (2) - 336 freq summers (2) - 13 freq nummer's (2) - 2 freq nummert (2) - 4 freq bummers (2) - 18 freq numbers (2) - 64 freq memmers (3) - 40 freq yammers (3) - 3 freq gimmers (3) - 3 freq nemmes (3) - 10 freq nummur (3) - 1 freq hemmers (3) - 1 freq immers (3) - 2 freq nummerin (3) - 6 freq limmers (3) - 3 freq simmers (3) - 16 freq hammers (3) - 6 freq incummers (3) - 4 freq timmers (3) - 6 freq emmers (3) - 4 freq intimmers (4) - 25 freq haimmers (4) - 1 freq numerous (4) - 8 freq aumers (4) - 4 freq |
SoundEx code - N562 nummers - 107 freq nummer's - 2 freq numerous - 8 freq newmarket - 1 freq nynorsk - 2 freq numerical - 1 freq non-work - 1 freq numeracy - 3 freq |
MetaPhone code - NMRS numbers - 64 freq nummers - 107 freq nummer's - 2 freq numerous - 8 freq numeracy - 3 freq |
NUMMERS |
| Time to execute Levenshtein function - 0.212634 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.369622 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.027091 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.037718 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.001076 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. |