| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bikerneil (0) - 4 freq bikerin (3) - 1 freq kernel (3) - 1 freq cokernit (4) - 1 freq fikeane (4) - 1 freq bitternis (4) - 1 freq likeness (4) - 4 freq siderail (4) - 1 freq kirnel (4) - 5 freq aiverel (4) - 1 freq bikerguy (4) - 1 freq tinkerbell (4) - 2 freq bernie (4) - 2 freq likenin (4) - 2 freq bickerin (4) - 7 freq girnel (4) - 2 freq bienlie (4) - 2 freq fingernail (4) - 4 freq likener (4) - 1 freq tierney (4) - 1 freq biker (4) - 3 freq tigerlil (4) - 1 freq bigeene (4) - 2 freq birnin (4) - 2 freq minerwell (4) - 1 freq |
bikerneil (0) - 4 freq kernel (4) - 1 freq bikerin (4) - 1 freq kirnel (5) - 5 freq bikers (6) - 2 freq bienlie (6) - 2 freq girnel (6) - 2 freq biker (6) - 3 freq biker-like (6) - 1 freq birned (6) - 1 freq berne (6) - 1 freq bairnlie (6) - 2 freq birnin (6) - 2 freq bickerin (6) - 7 freq bernie (6) - 2 freq bermeal (6) - 1 freq bikinis (6) - 1 freq cokernit (6) - 1 freq bikini (6) - 6 freq kennel (6) - 11 freq berni (6) - 1 freq bikerguy (6) - 1 freq birnable (7) - 1 freq kirned (7) - 3 freq maternal (7) - 11 freq |
SoundEx code - B265 bickerin - 7 freq backgrun - 16 freq boxroom - 4 freq bigger'n - 1 freq backgrund - 32 freq backruim - 2 freq bjorn - 3 freq baakgroon - 1 freq bukkrem - 1 freq bukrem - 1 freq background - 14 freq buikworm - 1 freq buggerin - 3 freq backroom - 4 freq bighorn - 1 freq bizarn - 1 freq back-room - 1 freq bookworm - 1 freq beckgrun - 1 freq backgruns - 2 freq backgrunds - 3 freq backgroonds - 1 freq busrun - 1 freq bakgrun - 1 freq buik-room - 1 freq backgroon - 1 freq €˜baikery-on-the-go - 1 freq bikerin - 1 freq boaxroom - 1 freq backgrunn - 1 freq buggerin' - 3 freq backrooms - 1 freq backgroond - 1 freq baqrmee - 1 freq biggernpolitics - 1 freq bikramyogaessex - 1 freq bikerneil - 4 freq bqwrnwmvbx - 1 freq |
MetaPhone code - BKRNL bikerneil - 4 freq |
BIKERNEIL |
| Time to execute Levenshtein function - 0.283916 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.430693 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.027764 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.037810 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.000848 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. |