| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| numeracy (0) - 3 freq numeral (2) - 5 freq numerals (2) - 4 freq americy (3) - 1 freq literacy (3) - 34 freq numerical (3) - 1 freq numero (3) - 1 freq €œmercy (3) - 1 freq mercy (3) - 92 freq numerous (3) - 8 freq 'mercy (3) - 2 freq number'll (4) - 1 freq namely (4) - 10 freq someday (4) - 9 freq literary (4) - 63 freq mealy (4) - 5 freq query (4) - 2 freq sumday (4) - 1 freq samgray (4) - 29 freq caberay (4) - 1 freq sumer (4) - 1 freq gomeral (4) - 1 freq erack (4) - 1 freq uneasy (4) - 18 freq camera's (4) - 1 freq |
numeracy (0) - 3 freq numeral (3) - 5 freq mercy (4) - 92 freq 'mercy (4) - 2 freq numero (4) - 1 freq numerous (4) - 8 freq numerical (4) - 1 freq numerals (4) - 4 freq americy (4) - 1 freq namer (5) - 1 freq merci (5) - 1 freq merc (5) - 2 freq america (5) - 74 freq animacy (5) - 1 freq ramrace (5) - 1 freq americay (5) - 11 freq €œmercy (5) - 1 freq literacy (5) - 34 freq nuwara (6) - 2 freq nummers (6) - 107 freq nihrc (6) - 1 freq nucear (6) - 1 freq emery (6) - 1 freq numbered (6) - 5 freq limerick (6) - 7 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 |
NUMERACY |
| Time to execute Levenshtein function - 0.181630 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.338770 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.026990 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.036977 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.000836 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. |