| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bent (0) - 104 freq tent (1) - 460 freq bet (1) - 158 freq belt (1) - 162 freq bert (1) - 106 freq beat (1) - 212 freq fent (1) - 11 freq pent (1) - 39 freq brent (1) - 17 freq bene (1) - 106 freq bens (1) - 47 freq went (1) - 1923 freq ment (1) - 18 freq cent (1) - 20 freq be't (1) - 3 freq lent (1) - 38 freq blent (1) - 6 freq hent (1) - 6 freq vent (1) - 6 freq benn (1) - 1 freq beit (1) - 13 freq beet (1) - 18 freq bents (1) - 10 freq bett (1) - 4 freq gent (1) - 10 freq |
bent (0) - 104 freq bint (1) - 10 freq bunt (1) - 6 freq sent (2) - 546 freq belt (2) - 162 freq bend (2) - 102 freq bena (2) - 1 freq dent (2) - 4 freq rent (2) - 48 freq kent (2) - 1832 freq ben (2) - 609 freq benk (2) - 1 freq bet (2) - 158 freq best (2) - 1613 freq bount (2) - 1 freq tent (2) - 460 freq beyont (2) - 7 freq baint (2) - 1 freq banty (2) - 5 freq bantu (2) - 1 freq yent (2) - 1 freq bnto (2) - 1 freq bunty (2) - 12 freq gent (2) - 10 freq ent (2) - 3 freq |
SoundEx code - B530 boomed - 8 freq bendie - 2 freq bendy - 3 freq bent - 104 freq bunnet - 113 freq bandy - 13 freq bend - 102 freq bound - 58 freq beneath - 35 freq band - 181 freq bind - 20 freq bonnie-die - 1 freq bounty - 10 freq behind - 261 freq beamed - 6 freq bund - 12 freq beyond - 102 freq bunnet' - 2 freq bammed - 1 freq baund - 21 freq boond - 9 freq bummed - 11 freq bonnet - 34 freq boannet - 1 freq bunt - 6 freq binweed - 1 freq bond - 17 freq banned - 35 freq beyont - 7 freq boned - 2 freq behint - 5 freq bannit - 2 freq baint - 1 freq bint - 10 freq banty - 5 freq bunty - 12 freq baundy - 2 freq bondie - 3 freq baand - 13 freq bantie - 3 freq bundie - 1 freq bumed - 1 freq bumt - 1 freq bouned - 3 freq boonty - 1 freq 'behind' - 1 freq bunnit - 1 freq behiynd - 1 freq bayonet - 6 freq bonnieheid - 1 freq beand - 1 freq binwuid - 1 freq 'beyond - 1 freq beande - 1 freq bennett - 6 freq behynde - 1 freq bonnie-ee'd - 1 freq bount - 1 freq buoyant - 2 freq bannid - 1 freq bend-o - 1 freq boyndie - 6 freq bennite - 1 freq €˜band - 2 freq bmd - 1 freq bnto - 1 freq byamat - 1 freq bannet - 1 freq bond” - 1 freq bantu - 1 freq bindie - 1 freq binned - 1 freq bunnet” - 1 freq |
MetaPhone code - BNT bendie - 2 freq bendy - 3 freq bent - 104 freq bunnet - 113 freq bandy - 13 freq bend - 102 freq bound - 58 freq band - 181 freq bind - 20 freq bonnie-die - 1 freq bounty - 10 freq bund - 12 freq bunnet' - 2 freq baund - 21 freq boond - 9 freq bonnet - 34 freq boannet - 1 freq bunt - 6 freq bond - 17 freq banned - 35 freq boned - 2 freq bannit - 2 freq baint - 1 freq bint - 10 freq banty - 5 freq bunty - 12 freq baundy - 2 freq bondie - 3 freq baand - 13 freq bantie - 3 freq bundie - 1 freq bouned - 3 freq boonty - 1 freq bunnit - 1 freq beand - 1 freq beande - 1 freq bennett - 6 freq behynde - 1 freq bonnie-ee'd - 1 freq bount - 1 freq bannid - 1 freq bend-o - 1 freq boyndie - 6 freq bennite - 1 freq €˜band - 2 freq bnto - 1 freq bannet - 1 freq bond” - 1 freq bantu - 1 freq bindie - 1 freq binned - 1 freq bunnet” - 1 freq |
BENT |
| Time to execute Levenshtein function - 0.200145 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.342378 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.027661 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.037074 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.000944 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. |