| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| numerous (0) - 8 freq tumorous (2) - 2 freq tuberous (2) - 1 freq humorous (2) - 5 freq humerus (2) - 1 freq numero (2) - 1 freq numerals (2) - 4 freq timerous (2) - 2 freq numbers (3) - 64 freq timorous (3) - 13 freq murderous (3) - 5 freq nacrous (3) - 1 freq nummers (3) - 107 freq numeral (3) - 5 freq lustrous (3) - 1 freq onerous (3) - 1 freq cuprous (3) - 1 freq luminous (3) - 5 freq nervous (3) - 73 freq cumulous (3) - 1 freq timeous (3) - 7 freq amorous (3) - 3 freq numeracy (3) - 3 freq generous (3) - 21 freq nummer's (3) - 2 freq |
numerous (0) - 8 freq numerals (3) - 4 freq timerous (3) - 2 freq humerus (3) - 1 freq numero (3) - 1 freq tumorous (3) - 2 freq humorous (3) - 5 freq onerous (4) - 1 freq amorous (4) - 3 freq cumers (4) - 1 freq numeral (4) - 5 freq numeracy (4) - 3 freq aumers (4) - 4 freq tuberous (4) - 1 freq nummers (4) - 107 freq timorous (4) - 13 freq nacrous (4) - 1 freq numbers (4) - 64 freq nemea's (5) - 2 freq neebours (5) - 33 freq nemos (5) - 1 freq namer (5) - 1 freq nuris (5) - 1 freq rumours (5) - 24 freq anomalous (5) - 1 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 |
NUMEROUS |
| Time to execute Levenshtein function - 0.287429 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.569357 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.027024 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.071904 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.000845 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. |