| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dunlop (0) - 21 freq dunlops (1) - 3 freq dunlap (1) - 2 freq dunloy (1) - 4 freq dunlop's (2) - 1 freq dunlops' (2) - 1 freq dollop (2) - 3 freq dunlin (2) - 2 freq dunli (2) - 1 freq dunno (2) - 43 freq dunnoo (2) - 2 freq dunes (3) - 6 freq dunbar (3) - 48 freq tulip (3) - 2 freq pulp (3) - 4 freq dunked (3) - 2 freq diplo (3) - 1 freq dunter (3) - 2 freq sunup (3) - 1 freq dunch (3) - 27 freq duplex (3) - 1 freq duncer (3) - 6 freq dunjin (3) - 1 freq unyo (3) - 1 freq duller (3) - 2 freq |
dunlop (0) - 21 freq dunlap (1) - 2 freq dunlops (2) - 3 freq dunloy (2) - 4 freq dunlin (3) - 2 freq dunli (3) - 1 freq dollop (3) - 3 freq doonlow (4) - 1 freq joydunlop (4) - 2 freq dilip (4) - 1 freq dounload (4) - 1 freq develop (4) - 44 freq dnlf (4) - 1 freq dunlops' (4) - 1 freq dunlop's (4) - 1 freq dunno (4) - 43 freq dunnoo (4) - 2 freq djulp (4) - 1 freq dunder (5) - 5 freq daunton (5) - 2 freq collop (5) - 1 freq unlik (5) - 1 freq dunky (5) - 1 freq dunfy (5) - 1 freq dule (5) - 37 freq |
SoundEx code - D541 dunlop - 21 freq dunlops' - 1 freq dunlops - 3 freq dunlap - 2 freq dunlop's - 1 freq danielbye - 1 freq danielb - 1 freq dnlf - 1 freq danielfergie - 1 freq |
MetaPhone code - TNLP dunlop - 21 freq dunlap - 2 freq |
DUNLOP |
| Time to execute Levenshtein function - 0.193458 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.344838 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.027393 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.037979 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.000971 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. |