| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bengal (0) - 2 freq bengali (1) - 5 freq beggar (2) - 16 freq rental (2) - 9 freq ental (2) - 1 freq beaga (2) - 2 freq renga (2) - 2 freq bena (2) - 1 freq fergal (2) - 1 freq bensel (2) - 1 freq legal (2) - 84 freq beddal (2) - 4 freq began (2) - 296 freq bendan (2) - 1 freq singal (2) - 1 freq genral (2) - 4 freq penga (2) - 4 freq denial (2) - 14 freq senga (2) - 35 freq mental (2) - 118 freq bangan (2) - 1 freq genial (2) - 2 freq regal (2) - 2 freq dental (2) - 7 freq penal (2) - 5 freq |
bengal (0) - 2 freq bengali (1) - 5 freq bensel (3) - 1 freq singal (3) - 1 freq bungle (3) - 2 freq bangan (3) - 1 freq bangle (3) - 1 freq bingos (4) - 1 freq bungfu (4) - 2 freq bunnel (4) - 1 freq bangu (4) - 1 freq being (4) - 296 freq bung (4) - 2 freq beings (4) - 3 freq bing (4) - 38 freq bungin (4) - 3 freq bings (4) - 16 freq donegal (4) - 7 freq banged (4) - 26 freq angel (4) - 113 freq singil (4) - 34 freq beange (4) - 1 freq tingil (4) - 4 freq bing' (4) - 2 freq dangul (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 - BNKL bengali - 5 freq bengal - 2 freq bungalow - 12 freq bungle - 2 freq bangle - 1 freq |
BENGAL |
| Time to execute Levenshtein function - 0.201392 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.352372 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.027722 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.036940 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.000800 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. |