| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bigoted (0) - 2 freq bigotet (1) - 2 freq bigots (2) - 4 freq righted (2) - 2 freq blighted (2) - 2 freq lighted (2) - 3 freq piloted (2) - 1 freq bigged (2) - 30 freq bigot (2) - 4 freq bioated (2) - 1 freq booted (2) - 6 freq sighted (2) - 2 freq bigotry (2) - 9 freq nigged (3) - 1 freq birned (3) - 1 freq biried (3) - 3 freq ignited (3) - 1 freq pigged (3) - 1 freq eiged (3) - 1 freq fighter (3) - 9 freq bifore (3) - 2 freq bigton (3) - 1 freq gote (3) - 43 freq boned (3) - 2 freq scooted (3) - 7 freq |
bigoted (0) - 2 freq bigotet (2) - 2 freq bigot (3) - 4 freq bigotry (3) - 9 freq bigged (3) - 30 freq booted (3) - 6 freq bioated (3) - 1 freq bigots (3) - 4 freq begood (4) - 11 freq bagged (4) - 4 freq bolted (4) - 19 freq belted (4) - 15 freq berated (4) - 1 freq budgeted (4) - 1 freq batted (4) - 1 freq obligated (4) - 1 freq bleated (4) - 1 freq beleted (4) - 1 freq belated (4) - 6 freq boalted (4) - 1 freq booteed (4) - 1 freq begot (4) - 1 freq begoud (4) - 104 freq begged (4) - 30 freq butted (4) - 5 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 - BKTT bigotet - 2 freq bagdad - 2 freq backdate - 1 freq boycottit - 1 freq bigoted - 2 freq |
BIGOTED |
| Time to execute Levenshtein function - 0.204826 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.339821 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.027992 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.036897 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.000915 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. |