| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bienlike (0) - 2 freq bienlie (1) - 2 freq bairnlike (2) - 4 freq belike (2) - 5 freq bien-lyke (2) - 1 freq fifelike (3) - 3 freq 'belike (3) - 3 freq fitlike (3) - 1 freq billie (3) - 33 freq €¦unlike (3) - 1 freq quietlike (3) - 10 freq binfire (3) - 1 freq kinrike (3) - 1 freq sik-like (3) - 2 freq benside (3) - 1 freq bairn-like (3) - 1 freq ainlie (3) - 138 freq bendie (3) - 2 freq bairnlie (3) - 2 freq cranlike (3) - 2 freq wice-like (3) - 3 freq saelike (3) - 3 freq beinlie (3) - 1 freq waeklike (3) - 1 freq kin-like (3) - 1 freq |
bienlike (0) - 2 freq bienlie (2) - 2 freq bien-lyke (3) - 1 freq belike (3) - 5 freq bairnlike (3) - 4 freq beinlie (4) - 1 freq binkie (4) - 1 freq binlid (4) - 1 freq bienly (4) - 7 freq unlike (4) - 43 freq oonlike (4) - 1 freq bairnlik (4) - 1 freq bennite (5) - 1 freq beeline (5) - 3 freq wiselike (5) - 6 freq siklike (5) - 1 freq dislike (5) - 6 freq benk (5) - 1 freq wicelike (5) - 11 freq bee-line (5) - 3 freq siblike (5) - 15 freq bonnielike (5) - 1 freq bloke (5) - 24 freq unlik (5) - 1 freq bink (5) - 26 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 - BNLK bien-lyke - 1 freq bienlike - 2 freq boannie-laek - 1 freq bonnie-like - 1 freq bonnielike - 1 freq |
BIENLIKE |
| Time to execute Levenshtein function - 0.286020 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.430034 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.027980 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.038223 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.001044 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. |