| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bqwrnwmvbx (0) - 1 freq jaqrnsrbx (6) - 1 freq fmawvbx (6) - 1 freq brainwave (6) - 4 freq qwagwm (6) - 1 freq bqnwou (6) - 1 freq burnhaven (6) - 1 freq bairnw' (6) - 1 freq mqvrwv (6) - 1 freq barrowman (6) - 1 freq brawment (6) - 1 freq bernam (6) - 1 freq bawruim (6) - 2 freq bawroom (6) - 1 freq birnam (6) - 1 freq qwmi (7) - 1 freq bwpub (7) - 2 freq brom (7) - 1 freq qnv (7) - 1 freq wanwirt (7) - 2 freq borneo (7) - 3 freq brummils (7) - 2 freq bryanb (7) - 1 freq breem (7) - 8 freq govrnement (7) - 2 freq |
bqwrnwmvbx (0) - 1 freq brainwave (11) - 4 freq jaqrnsrbx (11) - 1 freq bawruim (12) - 2 freq bernam (12) - 1 freq bawroom (12) - 1 freq brwombat (12) - 1 freq brainwayve (12) - 1 freq brawment (12) - 1 freq brainwaive (12) - 3 freq birnam (12) - 1 freq fmawvbx (12) - 1 freq bqnwou (12) - 1 freq qwagwm (12) - 1 freq burnhaven (12) - 1 freq mqvrwv (12) - 1 freq bairnw' (12) - 1 freq barrowman (12) - 1 freq bairntime (13) - 3 freq birnable (13) - 1 freq brianma (13) - 1 freq burnawn (13) - 1 freq brunitex (13) - 1 freq bramble (13) - 1 freq briansmcl (13) - 1 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 - BKRNMFBKS bqwrnwmvbx - 1 freq |
BQWRNWMVBX |
| Time to execute Levenshtein function - 0.397492 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.872814 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.046756 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.074220 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.000908 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. |