| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baqrmee (0) - 1 freq barmet (2) - 1 freq barmen (2) - 1 freq barmie (2) - 1 freq agree (3) - 159 freq armed (3) - 18 freq waarmed (3) - 3 freq bardet (3) - 1 freq bairnie (3) - 70 freq bame (3) - 2 freq backmen (3) - 1 freq baw-bee (3) - 1 freq barney (3) - 25 freq barrier (3) - 13 freq fairmen (3) - 1 freq farmer (3) - 9 freq hairmed (3) - 4 freq cardee (3) - 1 freq bardie (3) - 1 freq barked (3) - 9 freq barkie (3) - 1 freq barnet (3) - 3 freq bare (3) - 175 freq paree (3) - 2 freq barnes (3) - 5 freq |
baqrmee (0) - 1 freq barmie (3) - 1 freq qrme (4) - 1 freq barmet (4) - 1 freq barmy (4) - 2 freq barmen (4) - 1 freq barrel (5) - 42 freq baimie (5) - 1 freq barries (5) - 1 freq burma (5) - 5 freq barley (5) - 33 freq barbie (5) - 3 freq breem (5) - 8 freq bliree (5) - 1 freq baurel (5) - 2 freq bared (5) - 6 freq barren (5) - 16 freq barrae (5) - 2 freq baurman (5) - 5 freq breme (5) - 1 freq barrie (5) - 15 freq barman (5) - 25 freq barnie (5) - 1 freq bairen (5) - 1 freq barque (5) - 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 - BKRM backruim - 2 freq bukkrem - 1 freq bukrem - 1 freq backroom - 4 freq back-room - 1 freq buik-room - 1 freq baqrmee - 1 freq |
BAQRMEE |
| Time to execute Levenshtein function - 0.201519 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.367132 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.028223 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.037023 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.001067 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. |