| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| namby (0) - 1 freq pamby (1) - 1 freq camby (1) - 1 freq namit (2) - 4 freq nkmy (2) - 1 freq amy (2) - 32 freq tabby (2) - 15 freq lambs (2) - 57 freq jambo (2) - 5 freq mby (2) - 1 freq navvy (2) - 1 freq nobby (2) - 1 freq nebby (2) - 2 freq naebd (2) - 1 freq lamb (2) - 63 freq narky (2) - 1 freq aby (2) - 11 freq nary (2) - 2 freq namer (2) - 1 freq jammy (2) - 19 freq hammy (2) - 7 freq nappy (2) - 15 freq habby (2) - 2 freq babby (2) - 25 freq name' (2) - 3 freq |
namby (0) - 1 freq pamby (2) - 1 freq camby (2) - 1 freq numb (2) - 25 freq named (3) - 53 freq namely (3) - 10 freq jamb (3) - 2 freq naurby (3) - 2 freq narb (3) - 2 freq nab (3) - 10 freq samba (3) - 1 freq nearby (3) - 51 freq names (3) - 304 freq gambo (3) - 1 freq lambo (3) - 1 freq damb (3) - 1 freq naeb (3) - 8 freq rambo (3) - 1 freq namesy (3) - 1 freq namin (3) - 7 freq bambi (3) - 1 freq name' (3) - 3 freq name (3) - 1220 freq nymy (3) - 1 freq inaby (3) - 2 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 - 1220 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 |
NAMBY |
| Time to execute Levenshtein function - 0.199975 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.351422 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.027776 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.037024 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. |