| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| josephine (0) - 11 freq joséphine (2) - 1 freq josaphina (2) - 1 freq joseph (3) - 64 freq hosepipe (3) - 1 freq joseph's (3) - 4 freq morphine (3) - 2 freq jowpin (4) - 1 freq somethin (4) - 1079 freq onethin (4) - 2 freq rose-hip (4) - 1 freq spine (4) - 26 freq omethin (4) - 1 freq 'joseph (4) - 1 freq shine (4) - 74 freq joopie (4) - 1 freq sophie (4) - 11 freq sphinx (4) - 2 freq somehing (4) - 6 freq toshie (4) - 15 freq jostlin (4) - 3 freq septile (4) - 5 freq stephane (4) - 1 freq modestine (4) - 3 freq jessamine (4) - 4 freq |
josephine (0) - 11 freq josaphina (2) - 1 freq joséphine (4) - 1 freq joseph (4) - 64 freq jamphin (5) - 1 freq jshone (5) - 1 freq joseph's (5) - 4 freq morphine (5) - 2 freq johne (6) - 1 freq josech (6) - 3 freq somehin (6) - 30 freq ootshine (6) - 3 freq dolphin (6) - 5 freq sechin (6) - 2 freq moshin (6) - 1 freq spehin (6) - 1 freq telephone (6) - 16 freq justine (6) - 33 freq janephi (6) - 1 freq calaphine (6) - 2 freq oshin (6) - 1 freq outshine (6) - 1 freq jessamine (6) - 4 freq sinhine (6) - 1 freq josep (6) - 1 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 - JSFN joséphine - 1 freq josephine - 11 freq josaphina - 1 freq |
JOSEPHINE |
| Time to execute Levenshtein function - 0.425253 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.856107 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.031476 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.087198 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.000783 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. |