| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| numerals (0) - 4 freq numeral (1) - 5 freq gomerals (2) - 1 freq funerals (2) - 14 freq numerous (2) - 8 freq almerals (2) - 1 freq numeracy (2) - 3 freq gomerils (3) - 5 freq funeral (3) - 82 freq emerald (3) - 17 freq minerals (3) - 4 freq emeralds (3) - 10 freq nuvels (3) - 1 freq €˜meals (3) - 1 freq neutrals (3) - 2 freq liberals (3) - 5 freq numbers (3) - 65 freq funeral' (3) - 1 freq nummers (3) - 110 freq murals (3) - 8 freq medals (3) - 15 freq numero (3) - 1 freq nemea's (3) - 2 freq neteral (3) - 1 freq number'll (3) - 1 freq |
numerals (0) - 4 freq numeral (2) - 5 freq almerals (3) - 1 freq numerous (3) - 8 freq gomerals (3) - 1 freq morals (4) - 10 freq murals (4) - 8 freq gomerels (4) - 2 freq admirals (4) - 2 freq nominals (4) - 1 freq neutrals (4) - 2 freq gomerils (4) - 5 freq numeracy (4) - 3 freq funerals (4) - 14 freq humerus (5) - 1 freq cameras (5) - 10 freq generals (5) - 2 freq numerical (5) - 1 freq gomeral (5) - 1 freq nuptials (5) - 1 freq camarels (5) - 1 freq aumers (5) - 4 freq merles (5) - 1 freq memorials (5) - 4 freq nirls (5) - 1 freq |
SoundEx code - N564 nummerless - 3 freq nine-year-auld - 2 freq numeral - 5 freq numerals - 4 freq |
MetaPhone code - NMRLS nummerless - 3 freq numerals - 4 freq |
NUMERALS |
| Time to execute Levenshtein function - 0.188660 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.414765 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.028430 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.038060 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.000950 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. |