| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beginning (0) - 18 freq beginnin (1) - 70 freq beginnins (1) - 6 freq beginnin' (1) - 1 freq begennin (2) - 6 freq beginnan (2) - 11 freq beginin (2) - 15 freq baeginnin (2) - 3 freq reminding (3) - 2 freq binding (3) - 1 freq beckoning (3) - 1 freq rinning (3) - 7 freq blinding (3) - 1 freq beinin (3) - 1 freq inning (3) - 1 freq begïnnin (3) - 1 freq skinning (3) - 1 freq dinning (3) - 1 freq begineen (3) - 3 freq believing (3) - 2 freq blinnin (3) - 1 freq grinning (3) - 5 freq defining (3) - 3 freq menning (3) - 1 freq bending (3) - 2 freq |
beginning (0) - 18 freq beginnin' (2) - 1 freq beginnins (2) - 6 freq beginnin (2) - 70 freq beginnan (3) - 11 freq baeginnin (3) - 3 freq begennin (3) - 6 freq beginin (4) - 15 freq banning (4) - 2 freq beginneen (4) - 1 freq spinning (5) - 9 freq belonging (5) - 4 freq bemeaning (5) - 1 freq beginners (5) - 2 freq girning (5) - 1 freq blinking (5) - 2 freq bemoaning (5) - 1 freq penning (5) - 2 freq beginner (5) - 2 freq thinning (5) - 1 freq breinging (5) - 1 freq brining (5) - 1 freq kenning (5) - 10 freq winning (5) - 13 freq bringing (5) - 15 freq |
SoundEx code - B255 beginnin - 70 freq becomin - 45 freq basement - 9 freq bazement - 1 freq back-comin - 1 freq beginning - 18 freq bogeyman - 2 freq becoming - 9 freq beckonin - 3 freq buchanan - 33 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 - BJNNK beginning - 18 freq |
BEGINNING |
| Time to execute Levenshtein function - 0.178216 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.365525 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.030360 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.036608 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.000862 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. |