| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| duncefleer (0) - 1 freq dancefleer (1) - 1 freq danceflair (3) - 2 freq dance-flerr (3) - 1 freq dunnideer (4) - 1 freq concealer (4) - 2 freq duncher (4) - 4 freq underweer (4) - 4 freq deleer (4) - 1 freq dunkellie (4) - 8 freq dance-flair (4) - 2 freq dueler (4) - 1 freq duncer (4) - 6 freq deceiver (5) - 2 freq auncles (5) - 1 freq uncalled (5) - 2 freq conceled (5) - 1 freq durisdeer (5) - 2 freq duckweed (5) - 1 freq queeklee (5) - 1 freq efler (5) - 1 freq puppeteer (5) - 1 freq duty-free (5) - 1 freq hunneryear (5) - 1 freq dunner (5) - 6 freq |
duncefleer (0) - 1 freq dancefleer (1) - 1 freq danceflair (3) - 2 freq dance-flerr (5) - 1 freq dance-flair (5) - 2 freq duncher (6) - 4 freq duncer (6) - 6 freq concealer (6) - 2 freq nuclear (7) - 32 freq sunfloor (7) - 1 freq dancer (7) - 31 freq dauncer (7) - 11 freq doncaster (7) - 4 freq dunnideer (7) - 1 freq dunkellie (7) - 8 freq deleer (7) - 1 freq dueler (7) - 1 freq snaffler (7) - 1 freq dundeefc (8) - 4 freq uncle (8) - 275 freq fleer (8) - 124 freq duller (8) - 2 freq cancelled (8) - 17 freq dunches (8) - 1 freq 'uncle' (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 |
DUNCEFLEER |
| Time to execute Levenshtein function - 0.231213 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.569061 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.028036 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.077975 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.000907 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. |