| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nickleby (0) - 3 freq nickety (2) - 1 freq fickle (3) - 11 freq nicklaus (3) - 1 freq nicky (3) - 8 freq nickie's (3) - 1 freq dimbleby (3) - 3 freq fickles (3) - 1 freq tickle (3) - 13 freq nicey (3) - 3 freq nicker (3) - 1 freq nicked (3) - 14 freq tickler (3) - 4 freq nicety (3) - 1 freq dickey (3) - 4 freq tickety (3) - 5 freq hickled (3) - 1 freq pickled (3) - 10 freq rickly (3) - 1 freq rickled (3) - 1 freq nicole (3) - 2 freq sickly (3) - 6 freq rickety (3) - 7 freq nickers (3) - 1 freq nicely (3) - 16 freq |
nickleby (0) - 3 freq nicklaus (4) - 1 freq nickety (4) - 1 freq pickle (5) - 30 freq rickle (5) - 31 freq tickled (5) - 8 freq nackety (5) - 1 freq tickles (5) - 5 freq nickers (5) - 1 freq nicely (5) - 16 freq rickles (5) - 4 freq pickles (5) - 2 freq sickle (5) - 4 freq neckline (5) - 1 freq necklace (5) - 28 freq nicoles (5) - 1 freq mickle (5) - 13 freq wickly (5) - 2 freq sickly (5) - 6 freq ackley (5) - 1 freq lickly (5) - 3 freq tickle (5) - 13 freq nicker (5) - 1 freq fickles (5) - 1 freq nickie's (5) - 1 freq |
SoundEx code - N241 nickleby - 3 freq nicolaforbes - 8 freq naesleep - 1 freq nicolaveighey - 3 freq neslb - 1 freq nzlabour - 1 freq nzjlhvl - 1 freq nigelhaversco - 2 freq |
MetaPhone code - NKLB nickleby - 3 freq |
NICKLEBY |
| Time to execute Levenshtein function - 0.356777 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.526462 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.027550 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.069946 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.000873 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. |