| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| crafurds (0) - 1 freq crawfurd (2) - 1 freq cratur's (2) - 9 freq craturd (2) - 1 freq craturs (2) - 41 freq seaburds (3) - 1 freq crawford's (3) - 2 freq caurs (3) - 10 freq craitur's (3) - 5 freq creatur's (3) - 1 freq cruds (3) - 2 freq cratur (3) - 63 freq crafties (3) - 1 freq rapurs (3) - 2 freq creaturs (3) - 4 freq crafters (3) - 1 freq claturs (3) - 1 freq caerds (3) - 1 freq crouds (3) - 2 freq crafts (3) - 5 freq oafurs (3) - 1 freq crafted (3) - 2 freq craiturs (3) - 96 freq creatures (3) - 29 freq caur's (3) - 1 freq |
crafurds (0) - 1 freq craturs (4) - 41 freq craturd (4) - 1 freq crawfurd (4) - 1 freq cratur's (4) - 9 freq creatures (5) - 29 freq craters (5) - 24 freq craiturs (5) - 96 freq crafted (5) - 2 freq coards (5) - 1 freq crafts (5) - 5 freq curds (5) - 3 freq racords (5) - 4 freq corfuarts (5) - 1 freq crawford (5) - 5 freq crouds (5) - 2 freq cairds (5) - 88 freq cards (5) - 33 freq cyaards (5) - 9 freq cruds (5) - 2 freq creatur's (5) - 1 freq craitur's (5) - 5 freq caerds (5) - 1 freq crafties (5) - 1 freq crawford's (5) - 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 - KRFRTS crafurds - 1 freq crawford's - 2 freq corfuarts - 1 freq |
CRAFURDS |
| Time to execute Levenshtein function - 0.210710 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.419316 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.028140 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.037567 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.000891 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. |