| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bnzlweekhw (0) - 1 freq ingleesh (5) - 4 freq engleesh (5) - 9 freq angleesh (5) - 7 freq blee (6) - 2 freq sneeky (6) - 1 freq between (6) - 192 freq unsteeked (6) - 1 freq beseek (6) - 1 freq bileeve (6) - 4 freq bleenge (6) - 1 freq leesh (6) - 2 freq weekly (6) - 25 freq un-cleek (6) - 1 freq naeweel (6) - 1 freq big-wee (6) - 1 freq bleepan (6) - 1 freq fleesh (6) - 3 freq blew (6) - 117 freq bangladesh (6) - 2 freq 'sweesh' (6) - 1 freq cleekin (6) - 11 freq bleep (6) - 2 freq cleekit (6) - 23 freq berween (6) - 1 freq |
bnzlweekhw (0) - 1 freq blackhaw (9) - 1 freq bangladesh (10) - 2 freq blwh (10) - 1 freq blxwakw (10) - 1 freq bzeww (10) - 1 freq buzlakd (10) - 1 freq ingleesh (10) - 4 freq engleesh (10) - 9 freq angleesh (10) - 7 freq blecker (11) - 2 freq brawwee (11) - 1 freq bleach (11) - 13 freq bleckie (11) - 1 freq blekly (11) - 1 freq unlaek (11) - 3 freq bleenk (11) - 1 freq sazleh (11) - 1 freq unleasht (11) - 2 freq knoweth (11) - 1 freq bttaweiiaw (11) - 1 freq bleckin (11) - 1 freq bleck' (11) - 1 freq unblenkin (11) - 1 freq blenks (11) - 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 - BNSLWK bnzlweekhw - 1 freq |
BNZLWEEKHW |
| Time to execute Levenshtein function - 0.493492 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.790955 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.032524 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.094340 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.001161 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. |