| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bastet (0) - 1 freq bastes (1) - 4 freq basnet (1) - 2 freq baste (1) - 8 freq tastet (1) - 1 freq basket (1) - 62 freq bastert (1) - 9 freq wastet (1) - 2 freq maset (2) - 1 freq wasted (2) - 24 freq tastit (2) - 29 freq bassett (2) - 1 freq aste (2) - 1 freq tastes (2) - 40 freq hasted (2) - 2 freq hasten (2) - 1 freq wastel (2) - 1 freq taistet (2) - 1 freq saltet (2) - 1 freq baxter (2) - 16 freq exastet (2) - 1 freq listet (2) - 1 freq faster (2) - 77 freq base (2) - 39 freq paste (2) - 10 freq |
bastet (0) - 1 freq wastet (2) - 2 freq bustit (2) - 2 freq boastit (2) - 1 freq basket (2) - 62 freq bastert (2) - 9 freq bastes (2) - 4 freq basnet (2) - 2 freq baste (2) - 8 freq tastet (2) - 1 freq mustet (3) - 1 freq busted (3) - 5 freq baisket (3) - 1 freq blastit (3) - 9 freq wastit (3) - 21 freq beamtet (3) - 1 freq bastle (3) - 1 freq boltet (3) - 1 freq bestest (3) - 5 freq pastit (3) - 1 freq lastit (3) - 13 freq bustlt (3) - 1 freq buttet (3) - 6 freq basalt (3) - 2 freq buster (3) - 2 freq |
SoundEx code - B233 buchtit - 4 freq besotted - 3 freq baghdad - 1 freq boastit - 1 freq busted - 5 freq big-heidit - 3 freq buchtitin - 1 freq bested - 2 freq bustit - 2 freq bigotet - 2 freq bak-hauddit - 1 freq bàstat' - 1 freq back-tae-dunbar - 1 freq bagdad - 2 freq bagdad's - 1 freq boasted - 1 freq boosted - 1 freq backdate - 1 freq boycottit - 1 freq bigoted - 2 freq bucketheidista - 1 freq bbcscotweather - 5 freq bastet - 1 freq |
MetaPhone code - BSTT besotted - 3 freq boastit - 1 freq busted - 5 freq bested - 2 freq bustit - 2 freq bàstat' - 1 freq boasted - 1 freq boosted - 1 freq bastet - 1 freq |
BASTET |
| Time to execute Levenshtein function - 0.206295 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.355967 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.027520 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.037358 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.000938 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. |