| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bazement (0) - 1 freq basement (1) - 9 freq bakemeat (2) - 1 freq casement (2) - 3 freq waement (2) - 1 freq amazement (2) - 5 freq easement (2) - 9 freq pavement (2) - 55 freq abatement (2) - 1 freq mazerment (2) - 1 freq paument (3) - 1 freq bumbazement (3) - 6 freq aisment (3) - 1 freq aisement (3) - 2 freq element (3) - 45 freq statement (3) - 109 freq pavements (3) - 26 freq waements (3) - 1 freq cement (3) - 27 freq ailment (3) - 2 freq waekent (3) - 1 freq lament (3) - 22 freq faemen (3) - 1 freq bellement (3) - 3 freq placement (3) - 6 freq |
bazement (0) - 1 freq basement (2) - 9 freq amazement (3) - 5 freq abatement (3) - 1 freq mazerment (4) - 1 freq amazemint (4) - 1 freq pavement (4) - 55 freq bakemeat (4) - 1 freq easement (4) - 9 freq casement (4) - 3 freq waement (4) - 1 freq enagement (5) - 1 freq griement (5) - 1 freq jugement (5) - 3 freq maiment (5) - 2 freq wament (5) - 1 freq augment (5) - 2 freq maidment (5) - 2 freq mament (5) - 14 freq greement (5) - 20 freq batmen (5) - 1 freq tenement (5) - 21 freq muvement (5) - 4 freq dazent (5) - 1 freq bemeanit (5) - 1 freq |
SoundEx code - B255 beginnin - 70 freq becomin - 45 freq basement - 9 freq bazement - 1 freq back-comin - 1 freq beginning - 21 freq bogeyman - 2 freq becoming - 9 freq beckonin - 3 freq buchanan - 32 freq beginnin' - 1 freq beginnins - 6 freq beckoning - 1 freq baeginnin - 3 freq buchanan's - 5 freq begïnnin - 1 freq begennin - 6 freq boss-man - 2 freq becoman - 2 freq beginin - 15 freq bycommon - 2 freq beginnan - 11 freq begineen - 3 freq backmen - 1 freq becumin - 1 freq bukeman - 1 freq bosnian - 1 freq busman's - 1 freq buchanienews - 1 freq bigmonsterlove - 3 freq beginneen - 1 freq |
MetaPhone code - BSMNT basement - 9 freq bazement - 1 freq |
BAZEMENT |
| Time to execute Levenshtein function - 0.264678 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.402038 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.028659 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.039940 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.000905 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. |