Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bjorn (0) - 3 freq born (1) - 333 freq brora (2) - 15 freq boon (2) - 7 freq porn (2) - 2 freq bonn (2) - 2 freq bairn (2) - 794 freq skorn (2) - 1 freq brown (2) - 81 freq 'john (2) - 6 freq bloun (2) - 1 freq bron (2) - 1 freq buon (2) - 1 freq voorn (2) - 1 freq bore (2) - 41 freq broun (2) - 154 freq adorn (2) - 6 freq jon (2) - 4 freq booin (2) - 17 freq join (2) - 131 freq bjrx (2) - 1 freq sworn (2) - 13 freq tmorn (2) - 1 freq shorn (2) - 7 freq birn (2) - 17 freq |
bjorn (0) - 3 freq born (2) - 333 freq boarn (3) - 66 freq bron (3) - 1 freq boran (3) - 2 freq burn (3) - 455 freq buirn (3) - 2 freq broon (3) - 500 freq bjrx (3) - 1 freq broun (3) - 154 freq bern (3) - 10 freq borna (3) - 1 freq birn (3) - 17 freq boren (3) - 1 freq baarn (3) - 1 freq bairn (3) - 794 freq barn (3) - 68 freq borin (3) - 46 freq borne (3) - 13 freq birrin (4) - 4 freq broone (4) - 1 freq berni (4) - 1 freq bizarn (4) - 1 freq bran (4) - 11 freq burran (4) - 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 - BJRN bjorn - 3 freq |
BJORN |
Time to execute Levenshtein function - 0.209111 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.436158 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.032187 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.037613 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.000923 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. |