| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dances (0) - 43 freq dantes (1) - 1 freq dancer (1) - 30 freq dancey (1) - 1 freq dance (1) - 376 freq dance's (1) - 2 freq danced (1) - 56 freq danes (1) - 2 freq dancis (1) - 2 freq dunces (1) - 5 freq lances (1) - 1 freq dancers (1) - 37 freq dangles (2) - 1 freq dacs (2) - 1 freq lance' (2) - 1 freq duncers (2) - 5 freq daince (2) - 1 freq finces (2) - 1 freq canes (2) - 2 freq danss (2) - 2 freq cancels (2) - 2 freq denies (2) - 12 freq dates (2) - 36 freq nancies (2) - 1 freq duncer (2) - 6 freq |
dances (0) - 43 freq dunces (1) - 5 freq dancis (1) - 2 freq dantes (2) - 1 freq dancey (2) - 1 freq dancers (2) - 37 freq dancer (2) - 30 freq lances (2) - 1 freq danes (2) - 2 freq dance's (2) - 2 freq dance (2) - 376 freq danced (2) - 56 freq danns (3) - 1 freq oonces (3) - 3 freq daniels (3) - 1 freq nuances (3) - 3 freq dansis (3) - 3 freq dancan (3) - 8 freq dancean (3) - 3 freq dancin (3) - 133 freq dauncers (3) - 11 freq dunced (3) - 10 freq ounces (3) - 1 freq lancs (3) - 1 freq dunes (3) - 6 freq |
SoundEx code - D522 dances - 43 freq dunkey's - 6 freq dunkies - 1 freq doncaster - 4 freq douncast - 2 freq donkeys - 9 freq dunces - 5 freq dooncast - 5 freq damascus - 6 freq demagogues - 2 freq dingies - 1 freq doonsize - 1 freq danssis - 1 freq dance's - 2 freq dionysius - 1 freq dinkies - 1 freq dunssis - 1 freq dunches - 1 freq dinghies - 1 freq damages - 1 freq dionysus - 2 freq denishakilloh - 3 freq doncasters - 1 freq dannycaz - 2 freq domjack - 1 freq dances - 1 freq dunnachuckbruck - 2 freq dmjack - 1 freq dansis - 3 freq dancis - 2 freq |
MetaPhone code - TNSS dances - 43 freq dennis's - 1 freq dunces - 5 freq doonsize - 1 freq tenses - 7 freq danssis - 1 freq dance's - 2 freq dionysius - 1 freq dunssis - 1 freq dionysus - 2 freq deans's - 1 freq dances - 1 freq dansis - 3 freq dancis - 2 freq |
DANCES |
| Time to execute Levenshtein function - 0.215765 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.514080 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.061295 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.037043 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.000820 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. |