| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| numpties (0) - 28 freq numphties (1) - 1 freq numptie (1) - 9 freq numptics (1) - 1 freq numpttes (1) - 1 freq numpties' (1) - 1 freq 'numpties' (2) - 1 freq empties (2) - 6 freq trumpties (2) - 1 freq nutties (2) - 1 freq pumpie (3) - 2 freq neckties (3) - 1 freq humpie (3) - 1 freq duties (3) - 16 freq campsies (3) - 1 freq noughties (3) - 1 freq tomaties (3) - 1 freq sunties (3) - 2 freq dumfries (3) - 41 freq wumpils (3) - 1 freq hempies (3) - 2 freq stumpies (3) - 1 freq nasties (3) - 1 freq nuptial (3) - 8 freq numpty (3) - 31 freq |
numpties (0) - 28 freq numpties' (2) - 1 freq numptics (2) - 1 freq numpttes (2) - 1 freq numptie (2) - 9 freq numphties (2) - 1 freq empties (3) - 6 freq gumptious (4) - 1 freq inimities (4) - 1 freq numpty (4) - 31 freq nutties (4) - 1 freq trumpties (4) - 1 freq 'numpties' (4) - 1 freq competes (5) - 1 freq nappies (5) - 9 freq niceties (5) - 1 freq cumpanies (5) - 3 freq aunties (5) - 16 freq emptiet (5) - 1 freq multies (5) - 1 freq emptied (5) - 20 freq tempts (5) - 2 freq lumpots (5) - 1 freq sumptuous (5) - 1 freq nomintes (5) - 1 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 - NMPTS numpties - 28 freq numpties' - 1 freq 'numpties' - 1 freq numpttes - 1 freq |
NUMPTIES |
| Time to execute Levenshtein function - 0.201843 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.342591 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.027214 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.037283 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.000891 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. |