| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bundle (0) - 18 freq bundlet (1) - 2 freq bundie (1) - 1 freq bundlie (1) - 1 freq bunnle (1) - 8 freq bundles (1) - 4 freq bungle (1) - 2 freq bundled (1) - 1 freq gundge (2) - 1 freq bund (2) - 12 freq caundle (2) - 7 freq bumfle (2) - 3 freq undae (2) - 3 freq guddle (2) - 34 freq bungee (2) - 1 freq bungles (2) - 1 freq buidhe (2) - 1 freq bendie (2) - 2 freq muddle (2) - 9 freq dundee (2) - 201 freq fundie (2) - 7 freq sindle (2) - 1 freq bustle (2) - 6 freq hurdle (2) - 3 freq sundae (2) - 3 freq |
bundle (0) - 18 freq bundlie (1) - 1 freq bungle (2) - 2 freq bundles (2) - 4 freq bundled (2) - 1 freq bunnle (2) - 8 freq bundlet (2) - 2 freq bundie (2) - 1 freq eandle (3) - 1 freq candle (3) - 19 freq kundly (3) - 1 freq beadle (3) - 9 freq bunder (3) - 1 freq windle (3) - 1 freq sandle (3) - 1 freq bunden (3) - 1 freq brindle (3) - 2 freq bangle (3) - 1 freq bundelt (3) - 1 freq haundle (3) - 9 freq bridle (3) - 13 freq handle (3) - 36 freq kindle (3) - 4 freq bodle (3) - 3 freq bondie (3) - 3 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 - BNTL bundle - 18 freq bentley - 4 freq bundlie - 1 freq |
BUNDLE bundle - 18 freq bundles - 4 freq |
| Time to execute Levenshtein function - 0.225234 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.364229 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.027824 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.039075 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.000893 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. |