| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| budgetit (0) - 1 freq budgetin (1) - 1 freq budgets (2) - 6 freq budgeted (2) - 1 freq budget (2) - 31 freq budget's (2) - 1 freq pudgetie (2) - 1 freq budderin (3) - 6 freq fidgetin (3) - 4 freq buttit (3) - 4 freq bucketin (3) - 2 freq bultit (3) - 1 freq buchtit (3) - 4 freq buggert (3) - 3 freq budgells (3) - 1 freq nudgit (3) - 1 freq targetit (3) - 1 freq updaetit (3) - 2 freq buffett (3) - 1 freq buffetin (3) - 2 freq daetit (3) - 1 freq hungerit (3) - 1 freq budgie (3) - 9 freq bustit (3) - 2 freq budged (3) - 1 freq |
budgetit (0) - 1 freq budgetin (2) - 1 freq budget (3) - 31 freq budgets (3) - 6 freq budgeted (3) - 1 freq pudgetie (4) - 1 freq budget's (4) - 1 freq budged (5) - 1 freq budge (5) - 12 freq bustit (5) - 2 freq budgie (5) - 9 freq ludgit (5) - 5 freq mudgit (5) - 1 freq bigotet (5) - 2 freq daetit (5) - 1 freq burnett (5) - 14 freq burstit (5) - 1 freq budgin (5) - 3 freq burtit (5) - 1 freq fidgetin (5) - 4 freq buchtit (5) - 4 freq bultit (5) - 1 freq buttit (5) - 4 freq nudgit (5) - 1 freq buggert (5) - 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 - BJTT budgeted - 1 freq budgetit - 1 freq |
BUDGETIT |
| Time to execute Levenshtein function - 0.261417 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.467103 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.031704 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.042959 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.001016 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. |