| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| crawford (0) - 5 freq crawfor (1) - 1 freq crawfurd (1) - 1 freq trafford (2) - 1 freq crawford's (2) - 2 freq crawroad (2) - 1 freq racord (3) - 2 freq raicord (3) - 1 freq afford (3) - 85 freq cranmore (3) - 1 freq chambord (3) - 2 freq crafted (3) - 2 freq crawdoun (3) - 1 freq wford (3) - 1 freq stratford (3) - 1 freq crawler (3) - 1 freq crawed (3) - 7 freq watford (3) - 2 freq 'afford (3) - 1 freq crawled (3) - 26 freq cawdor (3) - 1 freq crowfoot (3) - 1 freq rashford (3) - 2 freq regcrawford (3) - 2 freq clifford (3) - 1 freq |
crawford (0) - 5 freq crawfurd (1) - 1 freq crawfor (2) - 1 freq crawroad (3) - 1 freq trafford (4) - 1 freq crawford's (4) - 2 freq regcrawford (5) - 2 freq crowfoot (5) - 1 freq crawled (5) - 26 freq clifford (5) - 1 freq craturd (5) - 1 freq crawler (5) - 1 freq drakeford (5) - 1 freq crafurds (5) - 1 freq crawed (5) - 7 freq crafted (5) - 2 freq wford (5) - 1 freq crackered (6) - 1 freq reward (6) - 47 freq craw-leid (6) - 1 freq rewaard (6) - 2 freq rewaird (6) - 8 freq crowner (6) - 19 freq careworn (6) - 1 freq cratered (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 - KRFRT crawford - 5 freq crawfurd - 1 freq |
CRAWFORD |
| Time to execute Levenshtein function - 0.196142 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.375942 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.027901 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.043634 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.001160 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. |