Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
biosphere (0) - 2 freq ionosphere (3) - 1 freq rnasphere (3) - 1 freq blogosphere (3) - 1 freq sphere (3) - 14 freq blaspheme (3) - 1 freq atmosphere (3) - 77 freq 'sphere (3) - 1 freq lithosphere (3) - 1 freq booster (4) - 3 freq topher (4) - 1 freq wilshire (4) - 2 freq botherd (4) - 1 freq dispare (4) - 1 freq dispure (4) - 1 freq disperse (4) - 3 freq bother (4) - 329 freq atmoshere (4) - 1 freq blasphemes (4) - 1 freq prospered (4) - 1 freq blasphemie (4) - 1 freq bithered (4) - 2 freq bordhers (4) - 1 freq nowhere (4) - 9 freq boathered (4) - 2 freq |
biosphere (0) - 2 freq 'sphere (4) - 1 freq ionosphere (4) - 1 freq sphere (4) - 14 freq blaspheme (5) - 1 freq atmosphere (5) - 77 freq rnasphere (5) - 1 freq blogosphere (5) - 1 freq bshara (6) - 1 freq fisther (6) - 1 freq birther (6) - 2 freq brochire (6) - 1 freq i'shore (6) - 1 freq sphere' (6) - 1 freq brother (6) - 285 freq blasphemy (6) - 1 freq blesphemie (6) - 3 freq kosher (6) - 1 freq behere (6) - 2 freq boather (6) - 5 freq brochure (6) - 8 freq blasphemer (6) - 1 freq blooper (6) - 1 freq brocher (6) - 2 freq fisher (6) - 41 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 - BSFR biosphere - 2 freq |
BIOSPHERE |
Time to execute Levenshtein function - 0.242745 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.591962 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.027869 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.070975 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. |