Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
backfires (0) - 1 freq backfire (1) - 1 freq backfired (1) - 3 freq backairts (2) - 1 freq backies (2) - 5 freq backwirds (2) - 2 freq backsides (2) - 2 freq backers (3) - 2 freq bakkies (3) - 1 freq baukies (3) - 2 freq backwyes (3) - 1 freq banefire (3) - 3 freq jacksies (3) - 2 freq backside (3) - 26 freq backarts (3) - 10 freq backflips (3) - 1 freq campfires (3) - 1 freq buckies (3) - 11 freq mackies (3) - 4 freq beckairts (3) - 1 freq backlins (3) - 18 freq backwise (3) - 1 freq backie (3) - 18 freq bonfires (3) - 8 freq baffies (3) - 21 freq |
backfires (0) - 1 freq backfired (2) - 3 freq backfire (2) - 1 freq backsides (4) - 2 freq backwirds (4) - 2 freq backers (4) - 2 freq backies (4) - 5 freq backairts (4) - 1 freq bonfires (5) - 8 freq beckairts (5) - 1 freq backwise (5) - 1 freq backwarts (5) - 3 freq backins (5) - 2 freq buckies (5) - 11 freq backdoors (5) - 1 freq backwards (5) - 36 freq backlins (5) - 18 freq backarts (5) - 10 freq backwyes (5) - 1 freq backflips (5) - 1 freq backrooms (6) - 1 freq mackers (6) - 1 freq bicker's (6) - 2 freq bankers (6) - 4 freq backwyse (6) - 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 - BKFRS backfires - 1 freq |
BACKFIRES |
Time to execute Levenshtein function - 0.443379 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.724622 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.038204 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.047241 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.000859 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. |