| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dartboard (0) - 1 freq dartboord (1) - 1 freq dashboard (2) - 3 freq eardboard (2) - 1 freq cardboard (2) - 31 freq aboard (3) - 21 freq cardboardy (3) - 1 freq outboard (3) - 1 freq smartboards (3) - 1 freq cerdboard (3) - 1 freq owreboard (3) - 1 freq washboard (3) - 1 freq cairdboard (3) - 12 freq ootboard (3) - 4 freq starboard (3) - 3 freq cupboard (4) - 53 freq harvard (4) - 2 freq tartare (4) - 1 freq yirbard (4) - 1 freq durward (4) - 2 freq garnard (4) - 1 freq dantoned (4) - 1 freq heidboard (4) - 3 freq cairdboord (4) - 1 freq chalkboard (4) - 1 freq |
dartboard (0) - 1 freq dartboord (1) - 1 freq cardboard (4) - 31 freq eardboard (4) - 1 freq dashboard (4) - 3 freq cairdboard (5) - 12 freq ootboard (5) - 4 freq owreboard (5) - 1 freq cerdboard (5) - 1 freq outboard (5) - 1 freq cardboardy (5) - 1 freq ootboord (6) - 2 freq overboard (6) - 2 freq cairdboord (6) - 1 freq darted (6) - 5 freq whiteboard (6) - 2 freq harboured (6) - 1 freq durward (6) - 2 freq skateboard (6) - 1 freq aertbark (6) - 2 freq starboard (6) - 3 freq yirbard (6) - 1 freq washboard (6) - 1 freq aboard (6) - 21 freq smartboards (6) - 1 freq |
SoundEx code - D631 dreadfu - 7 freq dreidfu - 20 freq dartboord - 1 freq dried-up - 2 freq dirtyfair - 1 freq 'dreidfu - 1 freq dartboard - 1 freq dreidfae - 2 freq dreadfully - 2 freq dreadful - 5 freq derthfu - 1 freq dare-deevils - 1 freq dirthope - 1 freq dredfu - 1 freq |
MetaPhone code - TRTBRT dartboord - 1 freq dartboard - 1 freq |
DARTBOARD |
| Time to execute Levenshtein function - 0.393365 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 - 1.000276 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.093045 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.100740 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.001194 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. |