| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bedcover (0) - 1 freq recover (2) - 7 freq believer (3) - 4 freq recovery (3) - 13 freq welcomer (3) - 1 freq dover (3) - 16 freq drover (3) - 1 freq bellower (3) - 1 freq 'cover (3) - 1 freq remover (3) - 3 freq beaver (3) - 5 freq newcomer (3) - 5 freq recovert (3) - 10 freq becomes (3) - 44 freq beloved (3) - 25 freq leftover (3) - 1 freq discover (3) - 32 freq rediscover (3) - 2 freq behoves (3) - 1 freq become (3) - 197 freq bedclaes (3) - 12 freq recovers (3) - 1 freq cover (3) - 147 freq server (4) - 2 freq beddie (4) - 3 freq |
bedcover (0) - 1 freq recover (4) - 7 freq deceiver (5) - 2 freq discover (5) - 32 freq beaver (5) - 5 freq cover (5) - 147 freq 'cover (5) - 1 freq bedclaes (5) - 12 freq rediscover (5) - 2 freq dover (5) - 16 freq drover (5) - 1 freq believer (5) - 4 freq recovery (5) - 13 freq buncher (6) - 1 freq discovery (6) - 22 freq bleacher (6) - 1 freq decore (6) - 1 freq blocker (6) - 2 freq mciver (6) - 1 freq decker (6) - 12 freq recoverie (6) - 1 freq codriver (6) - 1 freq draver (6) - 2 freq brocher (6) - 2 freq bovier (6) - 1 freq |
SoundEx code - B321 bath-sponge - 1 freq bedspread - 4 freq botox-brent - 1 freq bittikie-but - 1 freq bodsbeck' - 1 freq bodsbeck - 2 freq bedspreads - 1 freq bedspring - 1 freq bedcover - 1 freq btsportfootball - 1 freq bidesafe - 1 freq btsport - 1 freq |
MetaPhone code - BTKFR bedcover - 1 freq |
BEDCOVER |
| Time to execute Levenshtein function - 0.214182 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.402361 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.029376 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.046345 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.004608 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. |