| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dances (0) - 1 freq dances (2) - 43 freq dancean (3) - 3 freq dancey (3) - 1 freq danced (3) - 57 freq danes (3) - 2 freq lances (3) - 1 freq dancis (3) - 2 freq dance's (3) - 2 freq jones (3) - 1 freq dunces (3) - 5 freq dancer (3) - 31 freq danceen (3) - 4 freq dantes (3) - 1 freq dancers (3) - 37 freq dance (3) - 380 freq ganesh (4) - 6 freq wanes (4) - 2 freq winces (4) - 3 freq dane' (4) - 1 freq wance't (4) - 3 freq force (4) - 1 freq dauncer (4) - 11 freq hame (4) - 2 freq dane (4) - 55 freq |
dances (0) - 1 freq dances (4) - 43 freq jones (5) - 1 freq dunces (5) - 5 freq dancis (5) - 2 freq danceen (6) - 4 freq dance (6) - 380 freq daein (6) - 1 freq dons (6) - 2 freq dancer (6) - 31 freq dantes (6) - 1 freq dancers (6) - 37 freq dance's (6) - 2 freq dancean (6) - 3 freq danced (6) - 57 freq dancey (6) - 1 freq lances (6) - 1 freq danes (6) - 2 freq fanciest (7) - 2 freq douncast (7) - 2 freq danser (7) - 1 freq dancin' (7) - 4 freq daneside (7) - 1 freq finces (7) - 1 freq advances (7) - 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 tenses - 8 freq doonsize - 1 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.220329 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.567986 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.061108 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.042288 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.000919 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. |