| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| numptie (0) - 9 freq numpties (1) - 28 freq numpties' (2) - 1 freq numptics (2) - 1 freq numpty (2) - 30 freq emptie (2) - 1 freq numpttes (2) - 1 freq sumphie (2) - 1 freq numphties (2) - 1 freq humpie (2) - 1 freq pumpie (2) - 2 freq dumpie (2) - 1 freq cutie (3) - 4 freq mumpin (3) - 6 freq humphin (3) - 17 freq humpit (3) - 1 freq lumpit (3) - 1 freq sumwie (3) - 1 freq cuttie (3) - 30 freq temptin (3) - 11 freq bumphlie (3) - 1 freq nichtie (3) - 6 freq bumflie (3) - 2 freq cupplie (3) - 1 freq auchtie (3) - 3 freq |
numptie (0) - 9 freq numpty (2) - 30 freq numpties (2) - 28 freq emptie (3) - 1 freq mumpt (4) - 2 freq bumpit (4) - 4 freq dumpty (4) - 6 freq lumpit (4) - 1 freq humpty (4) - 7 freq pumpit (4) - 3 freq mumpit (4) - 2 freq pumpt (4) - 1 freq jumpt (4) - 8 freq humpit (4) - 1 freq jumpit (4) - 25 freq dumpit (4) - 6 freq sumphie (4) - 1 freq numptics (4) - 1 freq numpttes (4) - 1 freq numphties (4) - 1 freq humpie (4) - 1 freq dumpie (4) - 1 freq pumpie (4) - 2 freq numpties' (4) - 1 freq emptied (5) - 20 freq |
SoundEx code - N513 numpties - 28 freq numpties' - 1 freq numpty - 30 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 - 30 freq numptie - 9 freq noo-empty - 1 freq |
NUMPTIE |
| Time to execute Levenshtein function - 0.213938 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.333225 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.027795 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.036993 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.000852 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. |