| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bundlet (0) - 2 freq bundled (1) - 1 freq bundles (1) - 4 freq bundle (1) - 18 freq bungle (2) - 2 freq cuddlet (2) - 1 freq bundelt (2) - 1 freq bundlie (2) - 1 freq bunnles (2) - 3 freq bunnle (2) - 8 freq bundie (2) - 1 freq hundret (2) - 2 freq bunder (2) - 1 freq bungles (2) - 1 freq bullet (2) - 32 freq fundiet (2) - 1 freq bucklet (2) - 1 freq runklet (2) - 1 freq bunden (2) - 1 freq bunnet (2) - 111 freq budget (2) - 31 freq haundled (3) - 1 freq beadle (3) - 9 freq jundie (3) - 3 freq bondie (3) - 3 freq |
bundlet (0) - 2 freq bundle (2) - 18 freq bundles (2) - 4 freq bundled (2) - 1 freq bundelt (2) - 1 freq bundlie (3) - 1 freq bunnet (4) - 111 freq bunden (4) - 1 freq runklet (4) - 1 freq budget (4) - 31 freq bondit (4) - 1 freq bucklet (4) - 1 freq abundant (4) - 4 freq bendit (4) - 2 freq boundit (4) - 1 freq bandit (4) - 7 freq bungle (4) - 2 freq bunnle (4) - 8 freq cuddlet (4) - 1 freq fundiet (4) - 1 freq bundie (4) - 1 freq bunnles (4) - 3 freq bungles (4) - 1 freq bullet (4) - 32 freq bunder (4) - 1 freq |
SoundEx code - B534 bundle - 18 freq bentley - 4 freq bundlet - 2 freq bundles - 4 freq bunnet-lairds - 1 freq bundlie - 1 freq bundelt - 1 freq boundless - 1 freq bundled - 1 freq bundling - 1 freq bentleysteed - 1 freq bindelj - 1 freq |
MetaPhone code - BNTLT bundlet - 2 freq bundelt - 1 freq bundled - 1 freq |
BUNDLET |
| Time to execute Levenshtein function - 0.352456 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.547228 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.064415 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.040448 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.000870 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. |