| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| benalexcowley (0) - 1 freq bellyboley (6) - 1 freq ballygawley (6) - 1 freq ballyboley (6) - 1 freq balconies (7) - 5 freq benselled (7) - 1 freq beccsley (7) - 1 freq bareley (7) - 1 freq alextually (7) - 1 freq naewey (7) - 11 freq bentley (7) - 4 freq belatedly (7) - 1 freq expleecitly (7) - 1 freq reflexology (7) - 1 freq single-celled (7) - 1 freq helecopter (7) - 1 freq berkeley (7) - 3 freq gentlemanly (7) - 1 freq telescope (7) - 20 freq narrowly (7) - 1 freq balcomie (7) - 1 freq benachie (7) - 2 freq balcony (7) - 19 freq tentlessly (7) - 6 freq endlessly (7) - 3 freq |
benalexcowley (0) - 1 freq ballygawley (9) - 1 freq benefeicial (10) - 1 freq beckyexcell (10) - 1 freq bellyboley (10) - 1 freq ballyboley (10) - 1 freq unluckily (11) - 1 freq kenspeckle (11) - 134 freq cowley (11) - 1 freq bellicose (11) - 1 freq balcony (11) - 19 freq ellemcelle (11) - 1 freq bentowre (11) - 1 freq bellowed (11) - 2 freq reflexively (11) - 2 freq beneficial (11) - 4 freq fankle-cycle (11) - 1 freq benachie (11) - 2 freq bellower (11) - 1 freq kenspecle (11) - 1 freq beanpole (11) - 1 freq alexaulay (11) - 1 freq alextually (11) - 1 freq narrowly (11) - 1 freq belatedly (11) - 1 freq |
SoundEx code - B542 bonnie-lookin - 2 freq boonless - 1 freq bunnles - 3 freq bien-lyke - 1 freq bennels - 1 freq bunnels - 1 freq bienlike - 2 freq bienless - 2 freq boannie-laek - 1 freq bunnils - 1 freq bonnie-like - 1 freq bonnielike - 1 freq bounless - 1 freq bmylcvqiit - 1 freq bmlglyoc - 1 freq benalexcowley - 1 freq |
MetaPhone code - BNLKSKL benalexcowley - 1 freq |
BENALEXCOWLEY |
| Time to execute Levenshtein function - 0.209134 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.382700 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.032340 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.039173 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.000910 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. |