| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beginners (0) - 2 freq beginner (1) - 2 freq beginnins (2) - 6 freq beginneen (2) - 1 freq beginnin' (3) - 1 freq denners (3) - 11 freq menners (3) - 2 freq binders (3) - 1 freq believers (3) - 1 freq begins (3) - 83 freq bennels (3) - 1 freq henners (3) - 1 freq bemoaners (3) - 1 freq beeginirs (3) - 1 freq banners (3) - 15 freq engineers (3) - 7 freq mainners (3) - 20 freq beisnes (3) - 5 freq rinners (3) - 7 freq dinners (3) - 14 freq tenners (3) - 4 freq benders (3) - 1 freq beginning (3) - 21 freq blinness (3) - 4 freq bainner (3) - 2 freq |
beginners (0) - 2 freq beginner (2) - 2 freq beginnins (3) - 6 freq beeginirs (4) - 1 freq banners (4) - 15 freq beginneen (4) - 1 freq gunners (4) - 1 freq beggers (5) - 1 freq blinters (5) - 1 freq blinders (5) - 2 freq jenners (5) - 6 freq beginnin (5) - 70 freq winners (5) - 30 freq hinners (5) - 5 freq sinners (5) - 8 freq shinners (5) - 4 freq begin's (5) - 1 freq binnert (5) - 1 freq binner (5) - 2 freq begineen (5) - 3 freq bainner (5) - 2 freq blinkers (5) - 4 freq beginnan (5) - 11 freq cinners (5) - 4 freq bennels (5) - 1 freq |
SoundEx code - B256 back-somersault - 3 freq bakinrp - 1 freq buccaneerin - 1 freq backhaaner - 1 freq bookmark - 1 freq boggiemerk - 1 freq beginner - 2 freq backhauner - 1 freq beginners - 2 freq beeginirs - 1 freq bzgmhregs - 1 freq bbcnortheast - 8 freq bigmarkyb - 2 freq bbcnireland - 2 freq bbcmarkmardell - 4 freq bignormplease - 1 freq bigcommerce - 1 freq |
MetaPhone code - BJNRS beginners - 2 freq beeginirs - 1 freq |
BEGINNERS |
| Time to execute Levenshtein function - 0.223105 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.398228 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.027791 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.037957 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.000917 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. |