| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jackiebmsp (0) - 2 freq jackie's (3) - 2 freq jackieash (3) - 1 freq jackieme (3) - 2 freq jacksies (4) - 2 freq jack-easy (4) - 2 freq jakies (4) - 2 freq jackets (4) - 3 freq mackie's (4) - 2 freq backies (4) - 5 freq mackies (4) - 4 freq jackie (4) - 38 freq backers (5) - 2 freq tackings (5) - 1 freq talkies (5) - 1 freq jaggies (5) - 4 freq rockies (5) - 1 freq jaicket's (5) - 1 freq buckies (5) - 11 freq blackies (5) - 1 freq markies (5) - 1 freq hacker's (5) - 1 freq blackie's (5) - 2 freq jaddies (5) - 1 freq jaikie' (5) - 1 freq |
jackiebmsp (0) - 2 freq jackieme (6) - 2 freq jackieash (6) - 1 freq jackie's (6) - 2 freq jackets (7) - 3 freq jacksies (7) - 2 freq jack-easy (7) - 2 freq jacksie (8) - 3 freq joackey's (8) - 1 freq jacobs (8) - 1 freq jackals (8) - 1 freq backrooms (8) - 1 freq jeckets (8) - 1 freq jacob's (8) - 9 freq jack's (8) - 6 freq jacks (8) - 10 freq jackman (8) - 2 freq jaickets (8) - 18 freq jockina's (8) - 2 freq joackeys (8) - 1 freq jackboot (8) - 1 freq mackies (8) - 4 freq jaicket's (8) - 1 freq jakies (8) - 2 freq mackie's (8) - 2 freq |
SoundEx code - J215 jacobean - 2 freq joséphine - 1 freq josephine - 11 freq josaphina - 1 freq jacobmcampbell - 1 freq jazzpiano - 1 freq joecovenant - 4 freq jackiebmsp - 2 freq |
MetaPhone code - JKBMSP jackiebmsp - 2 freq |
JACKIEBMSP |
| Time to execute Levenshtein function - 0.227915 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.431019 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.033501 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.039907 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.000948 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. |