| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| badges (0) - 11 freq radges (1) - 1 freq badgey (1) - 1 freq gadges (1) - 1 freq barges (1) - 2 freq badge (1) - 14 freq wadges (1) - 1 freq badger (1) - 6 freq baager (2) - 15 freq cadge (2) - 2 freq barnes (2) - 5 freq fidges (2) - 2 freq cadger (2) - 5 freq radged (2) - 1 freq bad's (2) - 2 freq baegers (2) - 1 freq sadge (2) - 1 freq bodies (2) - 184 freq ganges (2) - 1 freq bangers (2) - 3 freq bardies (2) - 1 freq bauge (2) - 1 freq badder (2) - 5 freq cadgers (2) - 1 freq baddest (2) - 1 freq |
badges (0) - 11 freq wadges (2) - 1 freq budgies (2) - 1 freq badge (2) - 14 freq badger (2) - 6 freq barges (2) - 2 freq badgey (2) - 1 freq radges (2) - 1 freq gadges (2) - 1 freq bulges (3) - 2 freq hedges (3) - 38 freq bridges (3) - 13 freq edges (3) - 32 freq baddies (3) - 3 freq ridges (3) - 6 freq mudges (3) - 1 freq budget (3) - 31 freq bedes (3) - 1 freq baags (3) - 2 freq nudges (3) - 4 freq beadies (3) - 1 freq gadgies (3) - 28 freq budgets (3) - 6 freq waadges (3) - 1 freq budged (3) - 1 freq |
SoundEx code - B322 boytachs - 1 freq bitches - 6 freq bodices - 1 freq badges - 11 freq betsy's - 4 freq bite-sized - 1 freq bodachs - 2 freq bodychecks - 1 freq budgie's - 1 freq bitches - 1 freq badjokefriday - 1 freq bitchystichy - 5 freq bdjwj - 1 freq bitesize - 1 freq budgies - 1 freq |
MetaPhone code - BJS badges - 11 freq bogies - 3 freq bougies - 1 freq bogeys - 1 freq budgie's - 1 freq bawjaws - 3 freq bigissue - 1 freq budgies - 1 freq |
BADGES |
| Time to execute Levenshtein function - 0.194371 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.348007 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.027217 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.037428 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.000944 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. |