| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bellend (0) - 7 freq blend (2) - 18 freq belied (2) - 1 freq belle' (2) - 1 freq erlend (2) - 4 freq belld (2) - 1 freq bellenden (2) - 3 freq delled (2) - 2 freq yelled (2) - 20 freq gelled (2) - 1 freq belle (2) - 17 freq ellen (2) - 28 freq belles (2) - 1 freq belle's (2) - 1 freq melled (2) - 34 freq bellany (2) - 1 freq telled (2) - 2 freq wellen (2) - 1 freq beylen (2) - 1 freq fellen (2) - 1 freq belted (2) - 14 freq bellae'd (2) - 1 freq belten (2) - 1 freq bellin (2) - 3 freq ben-end (2) - 3 freq |
bellend (0) - 7 freq bellae'd (3) - 1 freq bellin (3) - 3 freq billed (3) - 2 freq bellany (3) - 1 freq fallend (3) - 1 freq wallend (3) - 1 freq bellenden (3) - 3 freq balled (3) - 6 freq belld (3) - 1 freq blend (3) - 18 freq bellied (3) - 3 freq holland (4) - 16 freq billeted (4) - 1 freq bellowed (4) - 2 freq tellen (4) - 3 freq selled (4) - 1 freq blind (4) - 41 freq bellynab (4) - 1 freq ballooned (4) - 1 freq blond (4) - 19 freq ballin (4) - 3 freq bullied (4) - 15 freq bollard (4) - 3 freq bland (4) - 7 freq |
SoundEx code - B453 blondie - 9 freq bluimed - 3 freq blindit - 8 freq blendin - 3 freq blinds - 16 freq blonde - 42 freq blunt - 8 freq blindin - 10 freq bluntie - 2 freq blondie's - 1 freq blindin-bricht - 2 freq blumed - 4 freq blint - 3 freq blund - 1 freq blinders - 2 freq blandness - 2 freq blondin - 1 freq blin-drift - 1 freq blinnt - 1 freq bool-in-the-mooth - 2 freq bluntly - 2 freq blemt - 2 freq blind - 41 freq blindfold - 2 freq blent - 6 freq blamed - 10 freq blindly - 1 freq blindrift - 1 freq bellindesert - 1 freq bellinderry - 1 freq blinters - 1 freq ballant - 11 freq blend - 18 freq bloomed - 3 freq ballants - 15 freq blond - 19 freq blinded - 4 freq blended - 2 freq bland - 7 freq blue-eened - 1 freq ballooned - 1 freq blondes - 2 freq blint' - 1 freq blonde-heidit - 3 freq blondie-heidit - 1 freq blin't - 1 freq blinnded - 1 freq blinnd - 14 freq blöndal - 1 freq blindsided - 1 freq blinnd-moorie - 1 freq blendan - 1 freq blaand - 1 freq bliind - 2 freq blinding - 1 freq balmedie - 7 freq blindness - 1 freq blindrife - 1 freq bellenden - 3 freq blintered - 2 freq blinterin - 8 freq boolmoothed - 1 freq blendit - 3 freq ballintuig - 3 freq blindlie - 1 freq blinter - 2 freq blunderin - 1 freq blintrin - 1 freq ballindalloch - 1 freq blandish - 1 freq blinder - 3 freq blinndit - 3 freq blindfolds - 1 freq ballantyne - 8 freq blinndin - 2 freq blindspots - 1 freq blunder - 3 freq blinndfoldit - 1 freq balintore - 1 freq bool-in-the-mou - 1 freq blind-sided - 1 freq blamet - 1 freq billionth - 1 freq blinnit - 1 freq blindt - 1 freq bealin-daft - 1 freq bellend - 7 freq ballondor - 1 freq blender - 3 freq blondiesup - 1 freq ballantine - 1 freq bylinetimes - 2 freq ballantrae - 1 freq |
MetaPhone code - BLNT blondie - 9 freq blonde - 42 freq blunt - 8 freq bluntie - 2 freq blint - 3 freq blund - 1 freq blinnt - 1 freq blind - 41 freq blent - 6 freq ballant - 11 freq blend - 18 freq blond - 19 freq bland - 7 freq blue-eened - 1 freq ballooned - 1 freq blint' - 1 freq blin't - 1 freq blinnd - 14 freq blaand - 1 freq bliind - 2 freq blinnit - 1 freq bellend - 7 freq |
BELLEND |
| Time to execute Levenshtein function - 0.213226 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.371566 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.028479 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.039602 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.000921 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. |