| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bungles (0) - 1 freq jungles (1) - 1 freq bunnles (1) - 3 freq bungle (1) - 2 freq kungles (1) - 1 freq bangles (1) - 3 freq bundles (1) - 4 freq bugles (1) - 1 freq gunales (2) - 1 freq runkles (2) - 1 freq rangles (2) - 1 freq jungle (2) - 38 freq bunged (2) - 7 freq tangles (2) - 3 freq bundle (2) - 18 freq mungle (2) - 2 freq buggies (2) - 3 freq bulges (2) - 2 freq hunnles (2) - 1 freq bogles (2) - 23 freq uncles (2) - 19 freq budgies (2) - 1 freq mingles (2) - 1 freq ingles (2) - 1 freq bunnle (2) - 8 freq |
bungles (0) - 1 freq bangles (1) - 3 freq bundles (2) - 4 freq kungles (2) - 1 freq bugles (2) - 1 freq jungles (2) - 1 freq bunnles (2) - 3 freq bungle (2) - 2 freq boggles (3) - 3 freq mingles (3) - 1 freq bogles (3) - 23 freq singles (3) - 5 freq tingles (3) - 1 freq angles (3) - 25 freq ingles (3) - 1 freq tangles (3) - 3 freq binges (3) - 1 freq bangle (3) - 1 freq dangles (3) - 1 freq bungs (3) - 1 freq rangles (3) - 1 freq angeles (4) - 4 freq bunnels (4) - 1 freq bunches (4) - 6 freq 'uncles (4) - 1 freq |
SoundEx code - B524 bangles - 3 freq bensel - 1 freq bengali - 5 freq binoculars - 8 freq bengal - 2 freq bungles - 1 freq bungalow - 12 freq benselled - 1 freq bang-wallop - 1 freq boun-skuil - 1 freq binkled - 1 freq bonny-coloured - 1 freq bangladesh - 2 freq bungalows - 2 freq bangalore - 1 freq bingolittle - 1 freq bungle - 2 freq bengilroy - 1 freq bonjela - 1 freq bvahmxcl - 1 freq bangle - 1 freq benglaze - 1 freq bnzlweekhw - 1 freq bankholidaymonday - 1 freq |
MetaPhone code - BNKLS bangles - 3 freq bungles - 1 freq bungalows - 2 freq benglaze - 1 freq |
BUNGLES |
| Time to execute Levenshtein function - 0.240848 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.415217 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.028487 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.039297 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.001128 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. |