| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drakeford (0) - 1 freq trafford (3) - 1 freq crawford (3) - 5 freq rashford (3) - 2 freq reform (4) - 42 freq dra'ers (4) - 2 freq remord (4) - 2 freq drawers (4) - 1 freq 'afford (4) - 1 freq braked (4) - 1 freq raicord (4) - 1 freq drawers (4) - 52 freq freeform (4) - 1 freq raked (4) - 16 freq record (4) - 99 freq wackford (4) - 1 freq framework (4) - 7 freq blackford (4) - 6 freq dramer (4) - 2 freq dramers (4) - 1 freq draper (4) - 2 freq transform (4) - 4 freq draed (4) - 1 freq afford (4) - 85 freq drapers (4) - 1 freq |
drakeford (0) - 1 freq crawford (5) - 5 freq trafford (5) - 1 freq drafted (6) - 2 freq crawfurd (6) - 1 freq wackford (6) - 1 freq akawakeford (6) - 3 freq dykefur (6) - 1 freq rashford (6) - 2 freq draaers (7) - 3 freq watford (7) - 2 freq drawed (7) - 1 freq draaed (7) - 1 freq darker (7) - 9 freq rakers (7) - 1 freq draaer (7) - 2 freq draabore (7) - 1 freq drawer (7) - 132 freq deform (7) - 1 freq markdrakeford (7) - 1 freq graveyard (7) - 9 freq frankfuird (7) - 1 freq drouked (7) - 1 freq derkened (7) - 4 freq orkneyrd (7) - 5 freq |
SoundEx code - D621 door-gap - 1 freq daurk-broon - 2 freq drug-fuelled - 1 freq derisively - 1 freq doricaubergine - 1 freq doricbananaman - 1 freq doricbanter - 1 freq doricphrases - 139 freq doorsopendays - 1 freq derekofhighbury - 1 freq dorisvulva - 7 freq diraaxvzyp - 1 freq derekbateman - 2 freq derickfaeyell - 2 freq drrosebland - 2 freq drakeford - 1 freq driseborough - 1 freq drawzfj - 2 freq drwsv - 1 freq |
MetaPhone code - TRKFRT tree-covered - 1 freq tree-covert - 1 freq drakeford - 1 freq |
DRAKEFORD |
| Time to execute Levenshtein function - 0.332899 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.646894 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.028112 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.082539 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.001206 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. |