| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beckyexcell (0) - 1 freq mackerrell (5) - 1 freq edexcel (5) - 2 freq bickered (6) - 1 freq beremael (6) - 1 freq recycle (6) - 3 freq tuckwell (6) - 1 freq yerscell (6) - 1 freq basketball (6) - 4 freq yersell (6) - 26 freq beeces (6) - 1 freq jekyll (6) - 14 freq pennywell (6) - 1 freq eternell (6) - 1 freq berkeley (6) - 3 freq beece (6) - 8 freq bejewel (6) - 1 freq becky's (6) - 1 freq decadence (6) - 2 freq secryfice (6) - 2 freq secryfice' (6) - 1 freq benefeicial (6) - 1 freq eesell (6) - 1 freq beckett (6) - 3 freq mackerel (6) - 8 freq |
beckyexcell (0) - 1 freq mackerrell (8) - 1 freq ticket'll (9) - 1 freq fuckinell (9) - 1 freq backerly (9) - 1 freq bicycle (9) - 8 freq basketball (9) - 4 freq edexcel (9) - 2 freq buckelt (9) - 2 freq back-alley (9) - 1 freq tuckwell (9) - 1 freq mickhill (10) - 3 freq benalexcowley (10) - 1 freq backpacks (10) - 1 freq mcnicoll (10) - 1 freq buckle (10) - 12 freq rocknroll (10) - 1 freq botticelli (10) - 1 freq backpackin (10) - 1 freq excel (10) - 3 freq cyexul (10) - 1 freq bee'll (10) - 2 freq jyle-cell (10) - 1 freq buckpool (10) - 3 freq back-chat (10) - 1 freq |
SoundEx code - B224 basically - 35 freq bicycle - 8 freq bi-sexual - 1 freq bicycles - 1 freq bisexuality - 1 freq bbchighlands - 1 freq beckyexcell - 1 freq buckiehighlib - 1 freq |
MetaPhone code - BKYKSSL beckyexcell - 1 freq |
BECKYEXCELL |
| Time to execute Levenshtein function - 0.206633 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.404857 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.028597 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.037407 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.000894 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. |