Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
background (0) - 13 freq backgroond (1) - 1 freq backgrund (1) - 32 freq backgruns (2) - 2 freq backgrun (2) - 16 freq backgroon (2) - 1 freq backgrunds (2) - 3 freq backgroonds (2) - 1 freq backgrunn (2) - 1 freq fairground (3) - 1 freq baakgroon (3) - 1 freq bakgrun (3) - 1 freq beckgrun (3) - 1 freq aground (3) - 1 freq backroad (3) - 1 freq backgmnd (3) - 1 freq around (4) - 154 freq back-pouch (4) - 1 freq backhaud (4) - 1 freq foreground (4) - 1 freq backroom (4) - 4 freq backlauns (4) - 1 freq baroune (4) - 1 freq back-room (4) - 1 freq barroun (4) - 1 freq |
background (0) - 13 freq backgrund (1) - 32 freq backgroond (1) - 1 freq backgroonds (3) - 1 freq backgrunn (3) - 1 freq backgrunds (3) - 3 freq backgroon (3) - 1 freq backgrun (3) - 16 freq backgruns (3) - 2 freq beckgrun (4) - 1 freq backgmnd (4) - 1 freq backroad (5) - 1 freq bakgrun (5) - 1 freq baakgroon (5) - 1 freq back-end (6) - 9 freq backgarden (6) - 1 freq aground (6) - 1 freq fairground (6) - 1 freq backend (6) - 4 freq backhaun (7) - 1 freq back-bowed (7) - 1 freq backson (7) - 12 freq ground (7) - 58 freq backruim (7) - 2 freq blackguard (7) - 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 buggerin - 3 freq backroom - 4 freq bighorn - 1 freq background - 13 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 - BKKRNT backgrund - 32 freq background - 13 freq backgroond - 1 freq |
BACKGROUND |
Time to execute Levenshtein function - 0.202082 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.363859 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.029641 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.041366 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.001058 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. |