| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| numptics (0) - 1 freq numpties (1) - 28 freq numpties' (2) - 1 freq numphties (2) - 1 freq numpttes (2) - 1 freq numptie (2) - 9 freq 'numpties' (3) - 1 freq nutties (3) - 1 freq wumpils (3) - 1 freq numpty (3) - 31 freq pumpkins (3) - 2 freq gumptious (3) - 1 freq auntics (3) - 1 freq sceptics (3) - 3 freq nuptials (3) - 1 freq gumpick (3) - 1 freq nuptial (3) - 8 freq gumption (3) - 12 freq uptick (3) - 1 freq lunatics (3) - 1 freq empties (3) - 6 freq trumpties (3) - 1 freq nguistics (3) - 1 freq dumplins (3) - 8 freq optics (3) - 2 freq |
numptics (0) - 1 freq numpties (2) - 28 freq numpttes (3) - 1 freq numptie (4) - 9 freq numphties (4) - 1 freq numpties' (4) - 1 freq sceptics (5) - 3 freq nuptials (5) - 1 freq nguistics (5) - 1 freq auntics (5) - 1 freq empties (5) - 6 freq optics (5) - 2 freq onomastics (5) - 2 freq gumptious (5) - 1 freq numpty (5) - 31 freq semantics (6) - 2 freq symptoms (6) - 22 freq camtacs (6) - 6 freq sympathics (6) - 1 freq romantics (6) - 1 freq sumptuous (6) - 1 freq antics (6) - 13 freq limpits (6) - 1 freq nymphs (6) - 4 freq notices (6) - 16 freq |
SoundEx code - N513 numpties - 28 freq numpties' - 1 freq numpty - 31 freq numbed - 4 freq numptie - 9 freq noo-empty - 1 freq numptics - 1 freq ninevites - 2 freq 'numpties' - 1 freq no-ya-no-butlike - 1 freq numpttes - 1 freq numphties - 1 freq nanobots - 1 freq non-votin - 1 freq non-paid - 1 freq 'numptieness' - 1 freq |
MetaPhone code - NMPTKS numptics - 1 freq |
NUMPTICS |
| Time to execute Levenshtein function - 0.195591 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.372518 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.027582 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.039297 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.000898 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. |