| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bangle (0) - 1 freq mangle (1) - 4 freq angle (1) - 22 freq baigle (1) - 1 freq bangles (1) - 3 freq tangle (1) - 6 freq bungle (1) - 2 freq cangle (1) - 2 freq rangle (1) - 2 freq jangle (1) - 5 freq fangle (1) - 1 freq 'angie (2) - 5 freq beagle (2) - 2 freq sange (2) - 1 freq mangled (2) - 6 freq tanglet (2) - 1 freq ange (2) - 1 freq burgle (2) - 1 freq bangor (2) - 9 freq mangie (2) - 2 freq bogle (2) - 45 freq hankle (2) - 1 freq bantie (2) - 3 freq bungee (2) - 1 freq bastle (2) - 1 freq |
bangle (0) - 1 freq bungle (1) - 2 freq cangle (2) - 2 freq jangle (2) - 5 freq rangle (2) - 2 freq fangle (2) - 1 freq mangle (2) - 4 freq angle (2) - 22 freq baigle (2) - 1 freq tangle (2) - 6 freq bangles (2) - 3 freq dangly (3) - 1 freq bugle (3) - 2 freq ingle (3) - 29 freq tengle (3) - 1 freq gangly (3) - 2 freq bangin (3) - 41 freq mungle (3) - 2 freq bunnle (3) - 8 freq anglo (3) - 2 freq wengle (3) - 1 freq jingle (3) - 2 freq bengal (3) - 2 freq bungles (3) - 1 freq banged (3) - 26 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 - BNKL bengali - 5 freq bengal - 2 freq bungalow - 12 freq bungle - 2 freq bangle - 1 freq |
BANGLE |
| Time to execute Levenshtein function - 0.211481 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.366551 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.027972 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.037155 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.000882 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. |