| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| budgets (0) - 6 freq budget's (1) - 1 freq budget (1) - 31 freq budgetin (2) - 1 freq burgers (2) - 11 freq budged (2) - 1 freq burgess (2) - 4 freq judges (2) - 19 freq ludges (2) - 2 freq judge's (2) - 1 freq buggers (2) - 31 freq sudgers (2) - 5 freq mudges (2) - 1 freq bulges (2) - 2 freq budgells (2) - 1 freq nuggets (2) - 6 freq begets (2) - 4 freq sodgets (2) - 1 freq fudges (2) - 1 freq budders (2) - 2 freq ludgers (2) - 4 freq budge (2) - 12 freq budgetit (2) - 1 freq buckets (2) - 25 freq budgies (2) - 1 freq |
budgets (0) - 6 freq budget's (2) - 1 freq budget (2) - 31 freq budgeted (3) - 1 freq begets (3) - 4 freq budgie's (3) - 1 freq badges (3) - 11 freq budgies (3) - 1 freq sodgets (3) - 1 freq midgets (3) - 5 freq budgetin (3) - 1 freq gadgets (3) - 6 freq budgetit (3) - 1 freq buckets (4) - 25 freq budge (4) - 12 freq bullets (4) - 27 freq bigots (4) - 4 freq bunnets (4) - 9 freq bukkets (4) - 1 freq ludgers (4) - 4 freq nudges (4) - 4 freq judges (4) - 19 freq judge's (4) - 1 freq burgess (4) - 4 freq budged (4) - 1 freq |
SoundEx code - B323 bedside - 20 freq bedecked - 3 freq baddest - 1 freq bitchit - 1 freq buddhist - 19 freq bedsheets - 2 freq budjct - 1 freq budget - 31 freq betwixt - 7 freq bethsaida - 5 freq budged - 1 freq bawdiest - 1 freq betocht - 1 freq budget's - 1 freq bedsit - 4 freq bedsyde - 1 freq bedsteid - 1 freq budgeted - 1 freq budgets - 6 freq bad-used - 1 freq butched - 2 freq bodhisattva - 1 freq bedsheet - 2 freq budgetit - 1 freq buddhists - 2 freq bed-syde - 1 freq beidside - 1 freq bedeckt - 1 freq bathgate - 4 freq bdxtb - 1 freq butwheyisgettingthedrinksin - 1 freq bidscotland - 1 freq budgetin - 1 freq bdzt - 1 freq bootstrapcook - 7 freq btwktk - 1 freq |
MetaPhone code - BJTS begets - 4 freq budget's - 1 freq budgets - 6 freq |
BUDGETS |
| Time to execute Levenshtein function - 0.195325 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.382612 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.028003 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.038620 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.000891 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. |