| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| begineen (0) - 3 freq beginneen (1) - 1 freq beginnan (2) - 11 freq beginner (2) - 2 freq beginin (2) - 15 freq beginnin (2) - 70 freq boileen (3) - 1 freq beeteen (3) - 1 freq begin' (3) - 1 freq regimen (3) - 3 freq between (3) - 192 freq beginnin' (3) - 1 freq beinin (3) - 1 freq lineen (3) - 1 freq begin's (3) - 1 freq besseen (3) - 1 freq begunked (3) - 4 freq bedien (3) - 1 freq beinn (3) - 2 freq berween (3) - 1 freq ayginee (3) - 1 freq beween (3) - 1 freq baeginnin (3) - 3 freq binmen (3) - 1 freq reinnen (3) - 1 freq |
begineen (0) - 3 freq beginin (2) - 15 freq beginneen (2) - 1 freq beginnan (3) - 11 freq beginnin (3) - 70 freq beginner (3) - 2 freq begins (4) - 83 freq begin (4) - 104 freq begen (4) - 11 freq biggeen (4) - 6 freq begane (4) - 1 freq beinn (4) - 2 freq begennin (4) - 6 freq burneen (4) - 2 freq baeginnin (4) - 3 freq begin' (4) - 1 freq beinin (4) - 1 freq binne (5) - 1 freq baegin (5) - 2 freq bogilan (5) - 1 freq begunk (5) - 18 freq maginn (5) - 1 freq beggin (5) - 33 freq burnen (5) - 1 freq remaineen (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 - BJNN beginnin - 70 freq beginnin' - 1 freq baeginnin - 3 freq begennin - 6 freq beginin - 15 freq beginnan - 11 freq begineen - 3 freq beginneen - 1 freq |
BEGINEEN |
| Time to execute Levenshtein function - 0.262627 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.536398 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.031612 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.043640 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.001157 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. |