Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
numb (0) - 25 freq nub (1) - 5 freq tumb (1) - 1 freq rumb (1) - 10 freq numm (1) - 1 freq dumb (1) - 38 freq nim (2) - 9 freq narb (2) - 2 freq nus (2) - 5 freq nfb (2) - 1 freq nemm (2) - 6 freq nom (2) - 2 freq jum (2) - 3 freq comb (2) - 18 freq lumn (2) - 1 freq nun (2) - 10 freq namby (2) - 1 freq hub (2) - 31 freq hump (2) - 15 freq omb (2) - 3 freq rumi (2) - 3 freq hums (2) - 3 freq csmb (2) - 1 freq nuo (2) - 1 freq number (2) - 174 freq |
numb (0) - 25 freq namby (2) - 1 freq numm (2) - 1 freq dumb (2) - 38 freq nub (2) - 5 freq rumb (2) - 10 freq tumb (2) - 1 freq rumba (3) - 1 freq nm (3) - 2 freq nitb (3) - 1 freq nmo (3) - 1 freq neb (3) - 276 freq unum (3) - 1 freq nem (3) - 53 freq nummi (3) - 3 freq nymy (3) - 1 freq nims (3) - 2 freq gmb (3) - 4 freq nib (3) - 10 freq nemd (3) - 1 freq nme (3) - 2 freq neeb (3) - 2 freq name (3) - 1219 freq jumbo (3) - 13 freq nb (3) - 4 freq |
SoundEx code - N510 numb - 25 freq namby - 1 freq nineveh - 3 freq non-pe - 1 freq ninevah - 2 freq nymph - 2 freq nomuv - 2 freq nmyymf - 1 freq |
MetaPhone code - NM name - 1219 freq nem - 53 freq 'name - 2 freq numb - 25 freq 'nemm - 2 freq gnome - 2 freq namby - 1 freq name' - 3 freq neem - 22 freq naim - 5 freq nim - 9 freq naomh - 1 freq nimmo - 7 freq numm - 1 freq naomi - 14 freq nemm - 6 freq naem - 48 freq nemme - 9 freq naime - 7 freq nehm - 1 freq nummi - 3 freq nemea - 9 freq neamh - 1 freq nayme - 2 freq ném - 1 freq nom - 2 freq €˜name - 1 freq niamh - 16 freq €˜niamh - 1 freq naamah - 2 freq nme - 2 freq niemi - 1 freq nm - 2 freq nmw - 1 freq gnom - 2 freq nymy - 1 freq nym - 1 freq nmo - 1 freq |
NUMB |
Time to execute Levenshtein function - 0.226500 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.441616 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.033525 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.041342 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.000956 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. |