| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| budget (0) - 31 freq budged (1) - 1 freq budgets (1) - 6 freq budge (1) - 12 freq budgetin (2) - 1 freq budgetit (2) - 1 freq bunged (2) - 7 freq gadget (2) - 2 freq burger (2) - 13 freq mudged (2) - 1 freq midget (2) - 6 freq bugger (2) - 141 freq ludgit (2) - 5 freq budder (2) - 47 freq badge (2) - 14 freq budgie (2) - 9 freq mudges (2) - 1 freq judges (2) - 19 freq bucket (2) - 75 freq nudge (2) - 79 freq bigget (2) - 1 freq bulged (2) - 4 freq bulge (2) - 4 freq beget (2) - 2 freq budgeted (2) - 1 freq |
budget (0) - 31 freq budge (2) - 12 freq budgets (2) - 6 freq budged (2) - 1 freq mudgit (3) - 1 freq budgeted (3) - 1 freq bigget (3) - 1 freq budgin (3) - 3 freq beget (3) - 2 freq nudgit (3) - 1 freq bridget (3) - 2 freq badges (3) - 11 freq fidget (3) - 3 freq budgies (3) - 1 freq badger (3) - 6 freq bidet (3) - 1 freq gadget (3) - 2 freq badgey (3) - 1 freq midget (3) - 6 freq ludgit (3) - 5 freq budgetit (3) - 1 freq budgetin (3) - 1 freq badge (3) - 14 freq budgie (3) - 9 freq buggert (4) - 3 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 - BJT budget - 31 freq budged - 1 freq beget - 2 freq |
BUDGET |
| Time to execute Levenshtein function - 0.358694 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.612227 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.035236 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.065662 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.000854 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. |