| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nickname (0) - 15 freq nick-name (1) - 1 freq nicknamed (1) - 5 freq nicknames (1) - 1 freq nickname's (2) - 1 freq nicknames' (2) - 1 freq nickum (3) - 1 freq nickums (3) - 1 freq nicklaus (3) - 1 freq necklace (3) - 28 freq pickaxe (3) - 1 freq nignae (3) - 1 freq i'same (4) - 10 freq vietnam (4) - 7 freq sicnaa (4) - 1 freq dinaye (4) - 1 freq dinnaye (4) - 2 freq -inghame (4) - 2 freq pickie (4) - 2 freq williame (4) - 1 freq neckline (4) - 1 freq knave (4) - 48 freq kickoan (4) - 1 freq irksome (4) - 4 freq nickety (4) - 1 freq |
nickname (0) - 15 freq nicknames (2) - 1 freq nicknamed (2) - 5 freq nick-name (2) - 1 freq nickum (4) - 1 freq nickname's (4) - 1 freq nicknames' (4) - 1 freq nickin (5) - 8 freq necklace (5) - 28 freq nickums (5) - 1 freq nicklaus (5) - 1 freq nicker (6) - 1 freq nickleby (6) - 3 freq beckham (6) - 2 freq packham (6) - 1 freq nicked (6) - 14 freq packam (6) - 1 freq buckihame (6) - 1 freq nick (6) - 133 freq nickit (6) - 4 freq nicky (6) - 8 freq nedknwmy (6) - 1 freq lickan (6) - 3 freq nickt (6) - 2 freq tickan (6) - 2 freq |
SoundEx code - N255 nickname - 15 freq nicknames' - 1 freq nicknames - 1 freq nicknamed - 5 freq newsmen - 2 freq nickname's - 1 freq no-cannin - 1 freq nick-name - 1 freq nous-an-nans - 1 freq |
MetaPhone code - NKNM nickname - 15 freq nick-name - 1 freq |
NICKNAME |
| Time to execute Levenshtein function - 0.177084 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.394340 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.033479 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.038706 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.000867 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. |