| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bqzjprojuf (0) - 1 freq qzprpkz (6) - 1 freq behouf (6) - 1 freq burou (6) - 1 freq bellpou (6) - 1 freq proud (6) - 153 freq cuprous (6) - 1 freq proof (6) - 48 freq boeuf (6) - 1 freq broun (6) - 154 freq broup (6) - 1 freq jojum (6) - 1 freq brouk (6) - 1 freq brogue (6) - 6 freq banterous (6) - 1 freq by-product (6) - 2 freq byproduct (6) - 1 freq bijou (6) - 1 freq brou (6) - 29 freq qzposjnk (6) - 1 freq bunroku (6) - 1 freq foolproof (6) - 1 freq projek (6) - 2 freq brous (6) - 5 freq bqnwou (6) - 1 freq |
bqzjprojuf (0) - 1 freq qzposjnk (11) - 1 freq fireproof (11) - 1 freq prof (11) - 29 freq proof (11) - 48 freq projet (11) - 1 freq foolproof (11) - 1 freq projek (11) - 2 freq qzprpkz (11) - 1 freq bedspread (12) - 4 freq qwryrj (12) - 1 freq qxypr (12) - 1 freq bnspf (12) - 1 freq qopwyuj (12) - 1 freq bmejf (12) - 1 freq preif (12) - 1 freq jpgrpf (12) - 1 freq zojyr (12) - 1 freq bizarre (12) - 11 freq qjbfj (12) - 4 freq qzp (12) - 1 freq bjorn (12) - 3 freq bedspreads (12) - 1 freq btfcpress (12) - 1 freq bizarrely (12) - 1 freq |
SoundEx code - B216 backfired - 3 freq backburner - 1 freq back-brakin - 1 freq backspeirin - 4 freq back-brekin' - 1 freq back-a-fore - 1 freq back-breakin - 1 freq back-speirin - 1 freq backspeirt - 1 freq bishopbriggs - 1 freq back-burdeen - 1 freq back-burdeens - 1 freq back-burden - 1 freq baccy-broon - 1 freq biosphere - 2 freq bucksburn - 1 freq back-buirds - 1 freq boys-fur-rags - 2 freq backfires - 1 freq byjavers - 1 freq bigbirds - 1 freq bbcsport - 5 freq bbcsportscot - 18 freq backfire - 1 freq bigburnssupper - 1 freq bbcsportsound - 6 freq bbcfour - 2 freq bqzjprojuf - 1 freq bkprimary - 2 freq bookbairn - 2 freq bbcsportwales - 1 freq bshipyardfc - 1 freq bbcspringwatch - 1 freq |
MetaPhone code - BKSJPRJF bqzjprojuf - 1 freq |
BQZJPROJUF |
| Time to execute Levenshtein function - 0.225953 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.421139 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.029675 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.045066 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.001158 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. |