| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ninian (0) - 5 freq ninian' (1) - 1 freq ninians (1) - 3 freq niniane (1) - 3 freq inion (2) - 1 freq midian (2) - 1 freq hintan (2) - 2 freq finin (2) - 3 freq tin-an (2) - 1 freq dingan (2) - 2 freq winnan (2) - 1 freq ringan (2) - 3 freq finman (2) - 2 freq ingan (2) - 11 freq minion (2) - 3 freq rinnan (2) - 3 freq jinin (2) - 8 freq dinin (2) - 24 freq ginin (2) - 1 freq finlan (2) - 1 freq mincan (2) - 1 freq nina (2) - 1 freq jinkan (2) - 1 freq fingan (2) - 1 freq sinians (2) - 1 freq |
ninian (0) - 5 freq niniane (1) - 3 freq nonin (2) - 1 freq ninians (2) - 3 freq ninian' (2) - 1 freq uinion (3) - 1 freq fenian (3) - 3 freq nihin (3) - 5 freq indian (3) - 32 freq inlan (3) - 1 freq minin (3) - 26 freq linin (3) - 10 freq rinin (3) - 2 freq annan (3) - 4 freq innin (3) - 34 freq nanna (3) - 1 freq ennin (3) - 2 freq binnian (3) - 2 freq ninja (3) - 2 freq nina (3) - 1 freq ainin (3) - 1 freq unenin (3) - 1 freq jinin (3) - 8 freq dinin (3) - 24 freq rinnan (3) - 3 freq |
SoundEx code - N550 namin - 6 freq newman' - 1 freq newman - 20 freq nomin - 1 freq ninian' - 1 freq naaman - 2 freq ninian - 5 freq naw-naw-naw - 1 freq nonin - 1 freq neemeen - 1 freq naemin - 1 freq niniane - 3 freq €œno-no-no- - 1 freq no-man - 2 freq |
MetaPhone code - NNN ninian' - 1 freq ninian - 5 freq naw-naw-naw - 1 freq nonin - 1 freq niniane - 3 freq nönin - 1 freq €œno-no-no- - 1 freq |
NINIAN |
| Time to execute Levenshtein function - 0.410810 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.801279 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.080803 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.085060 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.000839 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. |