| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bedclaes (0) - 12 freq bed-claes (1) - 4 freq bedlaes (1) - 1 freq bedclathes (2) - 1 freq beatles (3) - 1 freq becomes (3) - 42 freq beeches (3) - 1 freq benches (3) - 13 freq bedae (3) - 1 freq beaches (3) - 11 freq beeces (3) - 1 freq bedclothes (3) - 1 freq bedcover (3) - 1 freq seddles (3) - 1 freq blaes (3) - 4 freq belches (3) - 1 freq claes (3) - 582 freq bella's (3) - 5 freq enclaves (3) - 6 freq beetles (3) - 2 freq declares (3) - 5 freq redcoats (3) - 6 freq bellas (3) - 1 freq yellaes (3) - 2 freq belles (3) - 1 freq |
bedclaes (0) - 12 freq bedlaes (2) - 1 freq bed-claes (2) - 4 freq barclays (4) - 1 freq bedclathes (4) - 1 freq eccles (5) - 1 freq bedlam (5) - 6 freq €œclaes (5) - 1 freq bellas (5) - 1 freq beddies (5) - 2 freq redcoats (5) - 6 freq belles (5) - 1 freq bedes (5) - 1 freq becas (5) - 5 freq belies (5) - 1 freq bicycles (5) - 1 freq bellies (5) - 21 freq decals (5) - 1 freq declares (5) - 5 freq becaas (5) - 9 freq beetles (5) - 2 freq beaches (5) - 11 freq beeces (5) - 1 freq benches (5) - 13 freq beeches (5) - 1 freq |
SoundEx code - B324 bed-claes - 4 freq bedclathes - 1 freq bedclaes - 12 freq botticelli - 1 freq buit-soles - 1 freq batcheler - 1 freq budgells - 1 freq bedclothes - 1 freq btglqkqf - 1 freq |
MetaPhone code - BTKLS bed-claes - 4 freq bedclaes - 12 freq |
BEDCLAES claes - 582 freq bedclaes - 12 freq claethed - 2 freq |
| Time to execute Levenshtein function - 0.185876 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.332839 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.027443 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.036718 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.000881 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. |