Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
badger (0) - 6 freq gadger (1) - 1 freq wadger (1) - 5 freq banger (1) - 5 freq tadger (1) - 3 freq baager (1) - 15 freq cadger (1) - 5 freq badgey (1) - 1 freq badder (1) - 5 freq badge (1) - 14 freq badges (1) - 11 freq radges (2) - 1 freq bangers (2) - 3 freq danger (2) - 109 freq wager (2) - 9 freq barged (2) - 2 freq baiker (2) - 1 freq bigger (2) - 229 freq budge (2) - 12 freq wauger (2) - 3 freq baegers (2) - 1 freq jagger (2) - 2 freq budder (2) - 47 freq sodger (2) - 114 freq mauger (2) - 8 freq |
badger (0) - 6 freq badgey (2) - 1 freq badder (2) - 5 freq badge (2) - 14 freq cadger (2) - 5 freq badges (2) - 11 freq gadger (2) - 1 freq wadger (2) - 5 freq banger (2) - 5 freq baager (2) - 15 freq tadger (2) - 3 freq bangor (3) - 9 freq lodger (3) - 3 freq bugger (3) - 141 freq codger (3) - 2 freq ludger (3) - 4 freq budget (3) - 31 freq budder (3) - 47 freq rodger (3) - 4 freq ledger (3) - 1 freq cadgier (3) - 1 freq dodger (3) - 5 freq sodger (3) - 114 freq budge (3) - 12 freq bidder (3) - 1 freq |
SoundEx code - B326 butcher's - 19 freq budweisers - 3 freq butcher - 36 freq butchert - 1 freq bootcher's - 1 freq butchered - 4 freq body-swerve - 1 freq budwiser - 2 freq butchers - 12 freq badger - 6 freq buttcher's - 1 freq budweiser - 3 freq butchery - 2 freq bodygaird - 1 freq bodyswerve - 1 freq €œbutcher - 1 freq butchering - 1 freq butchermeat - 1 freq butchart - 1 freq beautycreep - 1 freq 'butcher - 1 freq biodegradable - 2 freq butcherj - 3 freq |
MetaPhone code - BJR badger - 6 freq baager - 15 freq beeger - 6 freq |
BADGER |
Time to execute Levenshtein function - 0.188809 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.358694 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.028636 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.038156 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.000844 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. |