| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blamed (0) - 10 freq blame (1) - 155 freq blared (1) - 3 freq blaaed (1) - 1 freq blawed (1) - 9 freq beamed (1) - 6 freq blamet (1) - 1 freq clamed (1) - 2 freq flamed (1) - 2 freq blames (1) - 4 freq blumed (1) - 4 freq glaumed (2) - 2 freq slaked (2) - 1 freq laced (2) - 6 freq slaved (2) - 1 freq blaand (2) - 1 freq shamed (2) - 8 freq caamed (2) - 1 freq glame (2) - 1 freq slawed (2) - 5 freq kamed (2) - 1 freq bumed (2) - 1 freq blanked (2) - 3 freq braced (2) - 1 freq claaed (2) - 2 freq |
blamed (0) - 10 freq blumed (1) - 4 freq blames (2) - 4 freq blared (2) - 3 freq blame (2) - 155 freq bluimed (2) - 3 freq bloomed (2) - 3 freq flamed (2) - 2 freq blawed (2) - 9 freq blaaed (2) - 1 freq clamed (2) - 2 freq beamed (2) - 6 freq blamet (2) - 1 freq plumed (3) - 1 freq bleated (3) - 1 freq bummed (3) - 11 freq bammed (3) - 1 freq lumed (3) - 1 freq baled (3) - 2 freq blowed (3) - 3 freq slimed (3) - 1 freq bladd (3) - 5 freq blade (3) - 55 freq boomed (3) - 8 freq blad (3) - 15 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 - BLMT bluimed - 3 freq blumed - 4 freq blemt - 2 freq blamed - 10 freq bloomed - 3 freq balmedie - 7 freq blamet - 1 freq |
BLAMED |
| Time to execute Levenshtein function - 0.185106 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.370483 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.028420 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.037051 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.000841 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. |