| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carver (0) - 14 freq career (1) - 65 freq carve (1) - 5 freq caiver (1) - 1 freq carer (1) - 10 freq carter (1) - 3 freq carven (1) - 1 freq carved (1) - 21 freq scarves (2) - 7 freq parker (2) - 19 freq haver (2) - 6 freq claiver (2) - 4 freq canker (2) - 4 freq carmen (2) - 2 freq carles (2) - 6 freq cairve (2) - 1 freq marvel (2) - 6 freq carmel (2) - 2 freq faiver (2) - 3 freq charger (2) - 7 freq carket (2) - 1 freq camper (2) - 1 freq scarve (2) - 1 freq carte (2) - 4 freq clarker (2) - 4 freq |
carver (0) - 14 freq carven (2) - 1 freq carved (2) - 21 freq carer (2) - 10 freq carter (2) - 3 freq carve (2) - 5 freq caiver (2) - 1 freq career (2) - 65 freq carvit (3) - 6 freq corer (3) - 1 freq fariver (3) - 10 freq carrier (3) - 15 freq curves (3) - 10 freq claver (3) - 14 freq cuiver (3) - 4 freq clover (3) - 17 freq cadaver (3) - 1 freq cuvver (3) - 1 freq clever (3) - 66 freq cover (3) - 148 freq coarner (3) - 46 freq carvt (3) - 1 freq chiver (3) - 1 freq cairved (3) - 15 freq crier (3) - 2 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 - KRFR carefree - 6 freq care-free - 1 freq graver - 1 freq carver - 14 freq crawfor - 1 freq |
CARVER |
| Time to execute Levenshtein function - 0.194669 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.367485 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.040529 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.037868 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.000877 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. |