Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
backfire (0) - 1 freq backfired (1) - 3 freq backfires (1) - 1 freq backie (2) - 18 freq backwise (2) - 1 freq backside (2) - 26 freq banefire (2) - 3 freq backyard (3) - 1 freq baffie (3) - 62 freq bankie (3) - 2 freq backbone (3) - 1 freq banffie (3) - 2 freq backlit (3) - 1 freq backing (3) - 3 freq baikie (3) - 1 freq baccie (3) - 1 freq blackbird (3) - 4 freq backsides (3) - 2 freq bbckile (3) - 1 freq binfire (3) - 1 freq blackford (3) - 6 freq backid (3) - 1 freq wackford (3) - 1 freq backward (3) - 12 freq jacksie (3) - 3 freq |
backfire (0) - 1 freq backfires (2) - 1 freq backfired (2) - 3 freq banefire (4) - 3 freq backside (4) - 26 freq backwise (4) - 1 freq backie (4) - 18 freq backin (5) - 41 freq bonefire (5) - 1 freq backake (5) - 1 freq backwye (5) - 1 freq backbane (5) - 2 freq ackir (5) - 1 freq backwyse (5) - 1 freq buckie (5) - 45 freq bicker (5) - 12 freq backin' (5) - 1 freq backsyke (5) - 1 freq blackface (5) - 3 freq backit (5) - 8 freq backwart (5) - 7 freq backies (5) - 5 freq bonfire (5) - 28 freq backins (5) - 2 freq backers (5) - 2 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 - BKFR back-a-fore - 1 freq backfire - 1 freq bbcfour - 2 freq |
BACKFIRE backfire - 1 freq backfired - 3 freq |
Time to execute Levenshtein function - 0.224595 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.404206 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.028279 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.037890 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.000912 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. |