| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cerebrum (0) - 1 freq cerebral (2) - 1 freq lerrum (3) - 3 freq hertbum (3) - 1 freq erebus (3) - 1 freq verborum (3) - 1 freq cerberus (3) - 15 freq leebrar (4) - 1 freq 'heedrum (4) - 1 freq perineum (4) - 2 freq hertbrek (4) - 1 freq precum (4) - 1 freq cereal (4) - 15 freq cream (4) - 136 freq forearm (4) - 1 freq celebs (4) - 4 freq creus (4) - 1 freq reheboam (4) - 2 freq feersum (4) - 4 freq herbeur (4) - 1 freq hertbrak (4) - 1 freq eeriorums (4) - 1 freq neebra (4) - 3 freq celery (4) - 5 freq creppul (4) - 1 freq |
cerebrum (0) - 1 freq cerebral (3) - 1 freq cerberus (4) - 15 freq verborum (4) - 1 freq lerrum (5) - 3 freq herbrie (6) - 6 freq currieboram (6) - 1 freq careers (6) - 12 freq carbrini (6) - 1 freq cherubim (6) - 1 freq variorum (6) - 2 freq careerism (6) - 1 freq carers (6) - 11 freq crum (6) - 1 freq careerne (6) - 1 freq carer (6) - 10 freq career (6) - 65 freq celebrity (6) - 17 freq crerar (6) - 1 freq cerry (6) - 7 freq corer (6) - 1 freq creatur (6) - 3 freq celebrate (6) - 86 freq crem (6) - 2 freq cebr (6) - 1 freq |
SoundEx code - C616 carefree - 6 freq carbrini - 1 freq cerebrum - 1 freq carberry - 2 freq caur-parks - 1 freq cerberus - 15 freq car-pairk - 3 freq corporate - 26 freq corporation - 5 freq corporations - 4 freq care-free - 1 freq crawford - 5 freq cerebral - 1 freq crapper - 1 freq cropper - 3 freq carpairk - 1 freq corporal - 22 freq cerbuird - 1 freq crafurds - 1 freq crawfurd - 1 freq creepers - 1 freq crawford's - 2 freq cerberus's - 1 freq chair-frame - 1 freq carpark - 5 freq currieboram - 1 freq carver - 14 freq corporately - 1 freq crobertsonuk - 15 freq corfuarts - 1 freq crawfor - 1 freq crowberries - 1 freq |
MetaPhone code - SRBRM cerebrum - 1 freq |
CEREBRUM |
| Time to execute Levenshtein function - 0.219862 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.386340 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.027650 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.037945 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.000843 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. |