| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nickleby (0) - 3 freq nickety (2) - 1 freq lickly (3) - 3 freq rickles (3) - 3 freq tickler (3) - 4 freq fickle (3) - 11 freq rickly (3) - 1 freq nicky (3) - 8 freq nackety (3) - 1 freq ilkley (3) - 1 freq tickle (3) - 12 freq nickers (3) - 1 freq mickey (3) - 24 freq nicely (3) - 16 freq nickie's (3) - 1 freq fickles (3) - 1 freq nicked (3) - 11 freq tickled (3) - 8 freq nicklaus (3) - 1 freq rickety (3) - 7 freq ackley (3) - 1 freq pickle (3) - 30 freq nicey (3) - 3 freq tickles (3) - 5 freq tickety (3) - 5 freq |
nickleby (0) - 3 freq nickety (4) - 1 freq nicklaus (4) - 1 freq rickled (5) - 1 freq nicker (5) - 1 freq hickled (5) - 1 freq pickle (5) - 30 freq ackley (5) - 1 freq nicole (5) - 2 freq tickles (5) - 5 freq rickle (5) - 31 freq mickle (5) - 13 freq necklace (5) - 27 freq pickles (5) - 2 freq nicoles (5) - 1 freq sickly (5) - 6 freq pickled (5) - 10 freq sickle (5) - 3 freq wickly (5) - 2 freq nicky (5) - 8 freq neckline (5) - 1 freq tickle (5) - 12 freq rickly (5) - 1 freq fickle (5) - 11 freq lickly (5) - 3 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.485097 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 - 1.096168 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.032283 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.101471 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.001070 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. |