| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| crawfor (0) - 1 freq crawford (1) - 5 freq cawdor (2) - 1 freq crawfurd (2) - 1 freq crawler (2) - 1 freq brawer (3) - 9 freq craiter (3) - 27 freq craetir (3) - 20 freq crowner (3) - 19 freq curator (3) - 5 freq cawdour (3) - 1 freq creator (3) - 5 freq crawlt (3) - 3 freq rawer (3) - 1 freq crater (3) - 13 freq crawl't (3) - 1 freq trawler (3) - 3 freq castor (3) - 3 freq craitur (3) - 126 freq crapper (3) - 1 freq craufy (3) - 1 freq crafty (3) - 7 freq craft (3) - 62 freq crawl (3) - 27 freq drawer (3) - 131 freq |
crawfor (0) - 1 freq crawford (2) - 5 freq crawfurd (3) - 1 freq crawler (3) - 1 freq crowfoot (4) - 1 freq cawdor (4) - 1 freq crowner (4) - 19 freq crawdoun (5) - 1 freq cratur (5) - 62 freq cracker (5) - 44 freq crawls (5) - 1 freq crawled (5) - 26 freq creautor (5) - 2 freq crafter (5) - 1 freq craeter (5) - 1 freq cawr (5) - 3 freq craw's (5) - 5 freq craw (5) - 66 freq crawick (5) - 1 freq cranmore (5) - 1 freq crawed (5) - 7 freq crazier (5) - 1 freq crasher (5) - 1 freq craws (5) - 59 freq craetur (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 - KRFR carefree - 6 freq care-free - 1 freq graver - 1 freq carver - 14 freq crawfor - 1 freq |
CRAWFOR |
| Time to execute Levenshtein function - 0.215819 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.375058 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.028699 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.038873 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.000965 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. |