| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| botswanan (0) - 1 freq botswana (1) - 9 freq botswana's (2) - 1 freq setswana (3) - 1 freq 'tswana (3) - 1 freq motswane (3) - 8 freq ootstaunin (4) - 3 freq jonanan (4) - 1 freq bemeanan (4) - 1 freq bosnian (4) - 1 freq brosnan (4) - 1 freq ootstannin (4) - 2 freq bogsoakin (4) - 2 freq ootstandin (4) - 3 freq botany (4) - 3 freq swayan (4) - 7 freq betrayan (4) - 1 freq boss-man (4) - 2 freq swaan (4) - 3 freq scotswoman (4) - 1 freq cownan (4) - 1 freq oot-walin (4) - 1 freq buchanan (4) - 33 freq bowman (4) - 4 freq bowan (4) - 1 freq |
botswanan (0) - 1 freq botswana (2) - 9 freq botswana's (4) - 1 freq motswane (5) - 8 freq setswana (5) - 1 freq 'tswana (5) - 1 freq bosnian (6) - 1 freq brosnan (6) - 1 freq ootstaunin (6) - 3 freq bytwene (7) - 1 freq between (7) - 182 freq bowan (7) - 1 freq bowman (7) - 4 freq bitsun (7) - 1 freq swanny (7) - 4 freq buchanan (7) - 33 freq batwing (7) - 1 freq twinin (7) - 6 freq stawnin (7) - 5 freq bitween (7) - 2 freq twynin (7) - 6 freq buttonin (7) - 4 freq ootstandin (7) - 3 freq ootstannin (7) - 2 freq betrayan (7) - 1 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 - BTSWNN botswanan - 1 freq |
BOTSWANAN |
| Time to execute Levenshtein function - 0.206442 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.377029 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.027429 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.038665 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.000809 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. |