Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bshipyardfc (0) - 1 freq shipyards (3) - 1 freq shipyard (3) - 4 freq shipyaird (4) - 8 freq shipyerds (4) - 1 freq shipyairds (4) - 5 freq shepherd's (6) - 7 freq ipzzrfc (6) - 1 freq shepherded (6) - 1 freq berneyardis (6) - 1 freq bizzard (6) - 1 freq cailyardis (6) - 1 freq shoarded (6) - 1 freq shepherds (6) - 15 freq 'shetlandic (6) - 1 freq backyard (6) - 1 freq shipman (6) - 3 freq shipped (6) - 4 freq kailyard (6) - 5 freq shard (6) - 2 freq shitmarack (6) - 1 freq shipbank (6) - 2 freq blizzards (6) - 1 freq 'shepherd' (6) - 1 freq bshara (6) - 1 freq |
bshipyardfc (0) - 1 freq shipyard (6) - 4 freq shipyards (6) - 1 freq shipyerds (7) - 1 freq shipyairds (7) - 5 freq shipyaird (7) - 8 freq bardic (10) - 5 freq shards (10) - 11 freq bshara (10) - 1 freq sporadic (10) - 3 freq 'shepherd' (10) - 1 freq shepherdin (10) - 1 freq shoard (10) - 4 freq shipraw (10) - 1 freq shoardin (10) - 1 freq shird (10) - 1 freq soporific (10) - 2 freq shepherd (10) - 48 freq shepherd' (10) - 1 freq shard (10) - 2 freq shepherds (10) - 15 freq shoarded (10) - 1 freq shipped (10) - 4 freq shepherded (10) - 1 freq shepherd's (10) - 7 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 - BXPYRTFK bshipyardfc - 1 freq |
BSHIPYARDFC |
Time to execute Levenshtein function - 0.221203 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.430564 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.028738 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.038291 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.000918 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. |