| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backrooms (0) - 1 freq backroom (1) - 4 freq bathrooms (2) - 1 freq bar-rooms (2) - 1 freq back-room (2) - 1 freq backdoors (2) - 1 freq warkrooms (2) - 1 freq backruim (3) - 2 freq backgroonds (3) - 1 freq backgroond (3) - 1 freq backroad (3) - 1 freq blackoots (3) - 1 freq bathroom (3) - 44 freq backdoor (3) - 2 freq backhoose (3) - 2 freq bathroom's (3) - 1 freq ballroom (3) - 5 freq bar-room (3) - 2 freq bedrooms (3) - 7 freq boardrooms (3) - 1 freq acroos (3) - 1 freq bawroom (3) - 1 freq backgroon (3) - 1 freq bedroom (4) - 154 freq jackrobbo (4) - 2 freq |
backrooms (0) - 1 freq backroom (2) - 4 freq backruim (4) - 2 freq backdoors (4) - 1 freq warkrooms (4) - 1 freq back-room (4) - 1 freq bathrooms (4) - 1 freq bar-rooms (4) - 1 freq backers (5) - 2 freq bedrooms (5) - 7 freq backarts (5) - 10 freq backhoose (5) - 2 freq backairts (5) - 1 freq boardrooms (5) - 1 freq backerties (5) - 1 freq backarties (5) - 3 freq backroad (5) - 1 freq backlins (6) - 18 freq ckeroos (6) - 1 freq backdraps (6) - 2 freq backins (6) - 2 freq backfires (6) - 1 freq backwyes (6) - 1 freq backweys (6) - 1 freq backsides (6) - 2 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 - BKRMS backrooms - 1 freq |
BACKROOMS |
| Time to execute Levenshtein function - 0.243425 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.427286 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.028888 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.061147 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.000903 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. |