| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| badinloskin (0) - 3 freq bedinloskin (1) - 1 freq bad-lookin (3) - 3 freq bad-luikin (4) - 1 freq nazi-lookin (4) - 1 freq bad-lookin' (4) - 1 freq bananaskin (4) - 1 freq invokin (5) - 1 freq daft-lookin (5) - 1 freq braw-lookin (5) - 4 freq binkin (5) - 1 freq painstakin (5) - 1 freq waxy-lookin (5) - 1 freq badminton (5) - 6 freq radge-lookin (5) - 2 freq finelookin (5) - 1 freq brainwashin (5) - 1 freq bollockin (5) - 1 freq blockin (5) - 17 freq badmoothin (5) - 1 freq waxylookin (5) - 1 freq hailsin (5) - 2 freq raminski (5) - 1 freq unlockin (5) - 2 freq vainishin (5) - 4 freq |
badinloskin (0) - 3 freq bedinloskin (1) - 1 freq bad-lookin (5) - 3 freq bananaskin (6) - 1 freq bad-luikin (6) - 1 freq bad-lookin' (7) - 1 freq blinkin (8) - 33 freq blokkin (8) - 1 freq bananasmin (8) - 8 freq unlockin (8) - 2 freq unloakin (8) - 1 freq baskin (8) - 10 freq onlookin (8) - 2 freq blockin (8) - 17 freq ballyhaskin (8) - 2 freq odd-lookin (8) - 1 freq bankin (8) - 19 freq oilskin (8) - 2 freq nazi-lookin (8) - 1 freq brainwashin (8) - 1 freq finelookin (8) - 1 freq bollockin (8) - 1 freq binkin (8) - 1 freq analysin (9) - 1 freq idolisin (9) - 1 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 |
BADINLOSKIN |
| Time to execute Levenshtein function - 0.334838 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.436905 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.032175 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.037421 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.000905 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. |