| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buddhism (0) - 7 freq buddhist (1) - 19 freq buddhists (2) - 2 freq buddhas (2) - 1 freq buddy's (3) - 2 freq buddies (3) - 14 freq buddom (3) - 5 freq buddum (3) - 3 freq buddin (3) - 11 freq buddoms (3) - 1 freq buddies' (3) - 1 freq fuddim (3) - 1 freq boddim (3) - 31 freq buddie (3) - 28 freq buddh (3) - 1 freq beddis (3) - 1 freq burdis (3) - 1 freq buddir (3) - 3 freq budders (3) - 2 freq buddha (3) - 15 freq fuddilt (4) - 2 freq burghs (4) - 7 freq gudis (4) - 3 freq buist (4) - 5 freq buskis (4) - 1 freq |
buddhism (0) - 7 freq buddhist (2) - 19 freq buddhas (3) - 1 freq buddhists (4) - 2 freq buddies' (5) - 1 freq boddim (5) - 31 freq buddh (5) - 1 freq buddoms (5) - 1 freq buddha (5) - 15 freq buddum (5) - 3 freq buddy's (5) - 2 freq buddies (5) - 14 freq buddom (5) - 5 freq beddis (5) - 1 freq budders (5) - 2 freq boddum (6) - 1 freq biddy's (6) - 2 freq boddem (6) - 1 freq biddies (6) - 3 freq baddies (6) - 3 freq beddies (6) - 2 freq biddins (6) - 12 freq baddest (6) - 1 freq buddir (6) - 3 freq buddie (6) - 28 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 - BTHSM buddhism - 7 freq |
BUDDHISM |
| Time to execute Levenshtein function - 0.190715 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.363583 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.027381 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.037149 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.000805 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. |