| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| botswana (0) - 9 freq botswanan (1) - 1 freq motswane (2) - 8 freq 'tswana (2) - 1 freq botswana's (2) - 1 freq setswana (2) - 1 freq bolotana (3) - 1 freq botany (3) - 3 freq bowan (3) - 1 freq boastin (4) - 3 freq bashans (4) - 1 freq loshan (4) - 1 freq banana (4) - 45 freq bogilan (4) - 1 freq constant (4) - 72 freq bathans (4) - 1 freq rottan (4) - 6 freq mcswan (4) - 28 freq bossing (4) - 2 freq boran (4) - 2 freq rottans (4) - 7 freq onywan (4) - 19 freq bosnian (4) - 1 freq potata (4) - 1 freq gowan (4) - 16 freq |
botswana (0) - 9 freq botswanan (2) - 1 freq setswana (3) - 1 freq 'tswana (3) - 1 freq motswane (3) - 8 freq botswana's (4) - 1 freq bitsun (5) - 1 freq bowan (5) - 1 freq bytwene (5) - 1 freq botany (5) - 3 freq bowsin (6) - 1 freq stowan (6) - 1 freq bossin (6) - 4 freq swan (6) - 23 freq baskan (6) - 1 freq bulwan (6) - 2 freq boson (6) - 1 freq boston (6) - 2 freq swona (6) - 1 freq bottlin (6) - 2 freq bitween (6) - 2 freq bethany (6) - 3 freq beeswax (6) - 5 freq bitan (6) - 1 freq between (6) - 192 freq |
SoundEx code - B325 botswana - 9 freq botswana's - 1 freq budgin - 3 freq beautician - 8 freq bedchaumers - 3 freq bedchaumer - 5 freq bewitchin - 1 freq bed-chaumer - 1 freq buddhism - 7 freq beauticians - 1 freq beautician's - 1 freq bits-on-the-side - 1 freq bodie-kyn - 1 freq betoken - 1 freq bitchin - 2 freq botswanan - 1 freq baudkin - 1 freq betokened - 1 freq body-snatchers - 2 freq body-snatcher - 1 freq bedeckin - 1 freq bitsun - 1 freq buits-on-the-street - 1 freq bitching - 1 freq bitsnbobs - 1 freq btywgnclxf - 1 freq batesmoira - 6 freq budsmam - 1 freq botcoin - 1 freq bidixm - 1 freq |
MetaPhone code - BTSWN botswana - 9 freq |
BOTSWANA |
| Time to execute Levenshtein function - 0.318321 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.593399 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.036580 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.069974 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.000890 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. |