Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
naemair (0) - 1 freq oniemair (2) - 4 freq naetir (2) - 1 freq naewhair (2) - 1 freq neermair (2) - 1 freq naewahr (2) - 1 freq naemer (2) - 3 freq naettir (2) - 1 freq naemin (2) - 1 freq naemit (2) - 1 freq nevvir (3) - 32 freq naggai (3) - 3 freq nebir (3) - 1 freq nweir (3) - 6 freq naewan (3) - 22 freq nadir (3) - 1 freq banesair (3) - 1 freq naar (3) - 7 freq admeir (3) - 2 freq samain (3) - 1 freq naemed (3) - 1 freq remairk (3) - 5 freq nair (3) - 2 freq nevar (3) - 1 freq nevir (3) - 8 freq |
naemair (0) - 1 freq oniemair (2) - 4 freq naemer (2) - 3 freq naemit (3) - 1 freq naemin (3) - 1 freq anymair (3) - 33 freq neymar (3) - 1 freq onymair (3) - 38 freq neermair (3) - 1 freq namer (3) - 1 freq naetir (3) - 1 freq anaemic (4) - 1 freq anaemia (4) - 1 freq niemi (4) - 1 freq navir (4) - 2 freq near (4) - 1175 freq naeter (4) - 1 freq naitir (4) - 1 freq nazir (4) - 1 freq neebir (4) - 13 freq memoir (4) - 3 freq onniemair (4) - 1 freq naerrie (4) - 1 freq naamah (4) - 2 freq neir (4) - 24 freq |
SoundEx code - N560 nummer - 336 freq namer - 1 freq nanr - 1 freq naemer - 3 freq naemair - 1 freq nummur - 1 freq nummmer - 1 freq numero - 1 freq neymar - 1 freq |
MetaPhone code - NMR nummer - 336 freq number - 174 freq namer - 1 freq nambarrie - 1 freq naemer - 3 freq naemair - 1 freq €œnumber - 1 freq nummur - 1 freq nummmer - 1 freq nhmbr - 1 freq numero - 1 freq neymar - 1 freq |
NAEMAIR |
Time to execute Levenshtein function - 0.215607 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.373974 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.028205 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.040059 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.000893 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. |