| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bedinloskin (0) - 1 freq badinloskin (1) - 3 freq bad-lookin (4) - 3 freq bollockin (5) - 1 freq bedouin (5) - 1 freq beildin (5) - 7 freq invokin (5) - 1 freq bad-luikin (5) - 1 freq unloakin (5) - 1 freq diglossia (5) - 3 freq odd-lookin (5) - 1 freq bedeckin (5) - 1 freq bellochin (5) - 3 freq feinishin (5) - 3 freq beikin (5) - 3 freq blinkin (5) - 33 freq belongin (5) - 1 freq brainwashin (5) - 1 freq blokkin (5) - 1 freq enjosin (5) - 1 freq unlockin (5) - 2 freq binkin (5) - 1 freq begowkin (5) - 6 freq enclosin (5) - 1 freq enlistin (5) - 1 freq |
bedinloskin (0) - 1 freq badinloskin (1) - 3 freq bad-lookin (6) - 3 freq bananaskin (7) - 1 freq bad-luikin (7) - 1 freq onlookin (8) - 2 freq blokkin (8) - 1 freq brainwashin (8) - 1 freq bad-lookin' (8) - 1 freq unlockin (8) - 2 freq binkin (8) - 1 freq blockin (8) - 17 freq oilskin (8) - 2 freq enlistin (8) - 1 freq finelookin (8) - 1 freq blinkin (8) - 33 freq unloakin (8) - 1 freq bedeckin (8) - 1 freq odd-lookin (8) - 1 freq bollockin (8) - 1 freq benisoun (9) - 1 freq boonsin (9) - 1 freq blenkin (9) - 1 freq bogsoakin (9) - 2 freq bankin (9) - 19 freq |
SoundEx code - B354 bottomless - 1 freq buttonhole - 2 freq boddamless - 1 freq boddomless - 3 freq badinloskin - 3 freq bedinloskin - 1 freq buttonholes - 1 freq |
MetaPhone code - BTNLSKN badinloskin - 3 freq bedinloskin - 1 freq |
BEDINLOSKIN |
| Time to execute Levenshtein function - 0.219959 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.411044 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.029189 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.039048 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.000913 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. |