| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dancefleer (0) - 1 freq duncefleer (1) - 1 freq dance-flerr (2) - 1 freq danceflair (2) - 2 freq dance-flair (3) - 2 freq danceen (4) - 4 freq concealer (4) - 2 freq dancer (4) - 31 freq deleer (4) - 1 freq wanceower (4) - 1 freq tap-fleer (4) - 1 freq danielle (4) - 1 freq cancelled (4) - 17 freq wance-aer (4) - 1 freq danced (5) - 57 freq danielowen (5) - 1 freq dancey (5) - 1 freq dunnideer (5) - 1 freq lanelie (5) - 1 freq doncaster (5) - 4 freq angeles (5) - 4 freq carefree (5) - 6 freq dannered (5) - 1 freq dances (5) - 1 freq daenner (5) - 1 freq |
dancefleer (0) - 1 freq duncefleer (1) - 1 freq danceflair (2) - 2 freq dance-flair (4) - 2 freq dance-flerr (4) - 1 freq dancer (6) - 31 freq concealer (6) - 2 freq duncer (7) - 6 freq snaffler (7) - 1 freq dauncer (7) - 11 freq doncaster (7) - 4 freq duncher (7) - 4 freq iancolour (7) - 1 freq cancelled (7) - 17 freq wance-aer (7) - 1 freq deleer (7) - 1 freq danceen (7) - 4 freq tap-fleer (7) - 1 freq wanceower (7) - 1 freq danielle (7) - 1 freq dancehall (7) - 1 freq december (8) - 56 freq cancellt (8) - 1 freq efler (8) - 1 freq dailer (8) - 1 freq |
SoundEx code - D521 dance-brand - 1 freq dance-flair - 2 freq danceflair - 2 freq dance-flerr - 1 freq donssupporters - 2 freq duncefleer - 1 freq dungsauping - 1 freq donsbarca - 12 freq dmcbfs - 2 freq dancefleer - 1 freq demcbot - 20 freq dunspitcus - 4 freq dmccafferty - 1 freq dinosofos - 1 freq domcavendish - 1 freq downshifter - 6 freq |
MetaPhone code - TNSFLR dance-flair - 2 freq danceflair - 2 freq dance-flerr - 1 freq duncefleer - 1 freq dancefleer - 1 freq |
DANCEFLEER |
| Time to execute Levenshtein function - 0.293461 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.477078 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.034829 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.048793 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.000990 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. |