| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nick-name (0) - 1 freq nickname (1) - 15 freq nicknames (2) - 1 freq nicknamed (2) - 5 freq nicknames' (3) - 1 freq eik-names (3) - 1 freq nickname's (3) - 1 freq nickums (4) - 1 freq eik-nem (4) - 1 freq necklace (4) - 28 freq nikkigate (4) - 1 freq pen-name (4) - 4 freq bird-names (4) - 1 freq nickie-tams (4) - 1 freq pickaxe (4) - 1 freq ilk-ane (4) - 1 freq kick-aff (4) - 4 freq duck-face (4) - 1 freq tick-tack (4) - 1 freq first-name (4) - 1 freq inmaname (4) - 1 freq nignae (4) - 1 freq nicey-nice (4) - 2 freq ice-age (4) - 1 freq nicht-late (4) - 1 freq |
nick-name (0) - 1 freq nickname (2) - 15 freq nicknamed (4) - 5 freq nicknames (4) - 1 freq nickie-tams (6) - 1 freq nicey-nice (6) - 2 freq nickin (6) - 8 freq eik-nem (6) - 1 freq nickum (6) - 1 freq eik-names (6) - 1 freq nickname's (6) - 1 freq nicknames' (6) - 1 freq nicklaus (7) - 1 freq nickin (7) - 1 freq buckihame (7) - 1 freq place-name (7) - 2 freq necklace (7) - 28 freq back-sate (7) - 1 freq neck- (7) - 1 freq neckin (7) - 3 freq seeck-time (7) - 2 freq pock-neuk (7) - 1 freq pick-aix (7) - 1 freq t-name (7) - 1 freq nicht-time (7) - 7 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 |
NICK-NAME |
| Time to execute Levenshtein function - 0.308119 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.451864 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.027608 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.039118 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.000884 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. |