| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| numpty (0) - 31 freq dumpty (1) - 6 freq humpty (1) - 7 freq jumpt (2) - 8 freq impty (2) - 14 freq lumpy (2) - 4 freq pumpt (2) - 1 freq mumpt (2) - 2 freq humphy (2) - 52 freq numptie (2) - 9 freq bumpy (2) - 1 freq jumpy (2) - 3 freq dumphy (2) - 50 freq empty (2) - 213 freq nutty (2) - 6 freq nummer (3) - 336 freq sumday (3) - 1 freq sump (3) - 3 freq sumwey (3) - 1 freq namesy (3) - 1 freq rumbly (3) - 1 freq nifty (3) - 3 freq sumps (3) - 1 freq dumps (3) - 14 freq jump's (3) - 1 freq |
numpty (0) - 31 freq humpty (2) - 7 freq numptie (2) - 9 freq dumpty (2) - 6 freq empty (3) - 213 freq mumpt (3) - 2 freq pumpt (3) - 1 freq jumpt (3) - 8 freq impty (3) - 14 freq hempt (4) - 1 freq nemyt (4) - 1 freq nummet (4) - 1 freq jumpit (4) - 25 freq namit (4) - 4 freq lumpit (4) - 1 freq compt (4) - 1 freq numpties (4) - 28 freq bumpit (4) - 4 freq tempt (4) - 9 freq jampt (4) - 1 freq enmity (4) - 4 freq campt (4) - 2 freq jumpet (4) - 1 freq pumpit (4) - 3 freq dumpit (4) - 6 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 - NMPT numpty - 31 freq numptie - 9 freq noo-empty - 1 freq |
NUMPTY |
| Time to execute Levenshtein function - 0.203914 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.386299 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.077781 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.089374 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.000941 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. |