| 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 nickums (3) - 1 freq necklace (3) - 27 freq nickum (3) - 1 freq nignae (3) - 1 freq pickaxe (3) - 1 freq nicklaus (3) - 1 freq michtnae (4) - 2 freq became (4) - 133 freq disnae (4) - 577 freq ginnae (4) - 1 freq nickin (4) - 7 freq peckage (4) - 2 freq mickle (4) - 13 freq name (4) - 1202 freq i'same (4) - 10 freq inate (4) - 1 freq nickerin (4) - 1 freq inane (4) - 2 freq nidebate (4) - 1 freq |
nickname (0) - 15 freq nicknamed (2) - 5 freq nicknames (2) - 1 freq nick-name (2) - 1 freq nickum (4) - 1 freq nicknames' (4) - 1 freq nickname's (4) - 1 freq nicklaus (5) - 1 freq nickin (5) - 7 freq nickums (5) - 1 freq necklace (5) - 27 freq nickt (6) - 2 freq kickoan (6) - 1 freq nickie's (6) - 1 freq buckihame (6) - 1 freq nicky (6) - 8 freq nickleby (6) - 3 freq tickan (6) - 2 freq nickin (6) - 1 freq beckham (6) - 2 freq neckline (6) - 1 freq lickan (6) - 3 freq nicked (6) - 11 freq nickety (6) - 1 freq pickan (6) - 4 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.297005 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.397309 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.027472 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.037729 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.000909 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. |