| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ntnmhnv (0) - 1 freq ntcztnv (3) - 1 freq binmen (4) - 1 freq xwmnv (4) - 1 freq ntahrr (4) - 1 freq normen (4) - 1 freq ninian' (4) - 1 freq niniane (4) - 3 freq techno (4) - 3 freq nthf (4) - 1 freq stymin (4) - 1 freq nanna (4) - 1 freq niemand (4) - 1 freq shamhna (4) - 1 freq no-man (4) - 2 freq tomini (4) - 2 freq finman (4) - 2 freq thuv (4) - 5 freq naomh (4) - 1 freq nomuv (4) - 2 freq naaman (4) - 2 freq nhv (4) - 1 freq wutnman (4) - 1 freq nanny (4) - 7 freq tmv (4) - 1 freq |
ntnmhnv (0) - 1 freq ntcztnv (6) - 1 freq wutnman (7) - 1 freq antnin (7) - 1 freq intmint (7) - 1 freq intenshuns (7) - 1 freq tinman (7) - 1 freq nutmon (7) - 1 freq nitheen (8) - 1 freq neythin (8) - 1 freq oontment (8) - 1 freq interment (8) - 1 freq intennin (8) - 1 freq tenement (8) - 21 freq naething (8) - 230 freq nauthin (8) - 2 freq nothen (8) - 1 freq anthony (8) - 12 freq eyntment (8) - 2 freq ninth (8) - 10 freq antonine (8) - 2 freq naithen (8) - 1 freq norman (8) - 58 freq kinmont (8) - 3 freq penman (8) - 1 freq |
SoundEx code - N355 newtonemerson - 1 freq nutmon - 1 freq nationinwaiting - 2 freq ntnmhnv - 1 freq |
MetaPhone code - NTNMNF ntnmhnv - 1 freq |
NTNMHNV |
| Time to execute Levenshtein function - 0.210053 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.386655 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.028758 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.049077 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.000932 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. |