| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| josephine (0) - 11 freq joséphine (2) - 1 freq josaphina (2) - 1 freq joseph (3) - 65 freq hosepipe (3) - 1 freq morphine (3) - 2 freq joseph's (3) - 4 freq shine (4) - 75 freq something (4) - 451 freq josep (4) - 1 freq josech (4) - 3 freq jessamine (4) - 4 freq stephane (4) - 1 freq somethin (4) - 1119 freq moonshine (4) - 1 freq outshine (4) - 1 freq dolphins (4) - 7 freq baseline (4) - 2 freq yosemite (4) - 2 freq josie (4) - 18 freq oshin (4) - 1 freq dolphin (4) - 5 freq nosedive (4) - 1 freq owerhink (4) - 5 freq opine (4) - 1 freq |
josephine (0) - 11 freq josaphina (2) - 1 freq joséphine (4) - 1 freq joseph (4) - 65 freq jamphin (5) - 1 freq joseph's (5) - 4 freq morphine (5) - 2 freq jshone (5) - 1 freq spehin (6) - 1 freq somehin (6) - 30 freq ootshine (6) - 3 freq johne (6) - 1 freq janephi (6) - 1 freq calaphine (6) - 2 freq moshin (6) - 1 freq jostlin (6) - 3 freq spine (6) - 28 freq sphinx (6) - 2 freq telephone (6) - 16 freq justine (6) - 33 freq 'joseph (6) - 1 freq sophie (6) - 11 freq sechin (6) - 2 freq jowpin (6) - 1 freq sinhine (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.323857 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.517519 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.035312 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.037127 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.000889 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. |