| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| danielb (0) - 1 freq daniel (1) - 128 freq daniels (1) - 1 freq daniela (1) - 2 freq danbell (2) - 2 freq daniel's (2) - 17 freq danielbye (2) - 1 freq danielle (2) - 1 freq daniella (2) - 1 freq 'daniel (2) - 1 freq ariel (3) - 5 freq darien (3) - 8 freq danser (3) - 1 freq hansels (3) - 3 freq banie (3) - 1 freq lanies (3) - 1 freq 'angela (3) - 1 freq dangult (3) - 1 freq cantelt (3) - 1 freq tangelt (3) - 2 freq denie (3) - 1 freq dangul (3) - 1 freq deanies (3) - 1 freq denies (3) - 12 freq handel (3) - 1 freq |
danielb (0) - 1 freq daniela (2) - 2 freq daniels (2) - 1 freq danielbye (2) - 1 freq daniel (2) - 128 freq daniella (3) - 1 freq danielle (3) - 1 freq denial (4) - 14 freq danbell (4) - 2 freq danelaw (4) - 3 freq 'daniel (4) - 1 freq daniel's (4) - 17 freq danse (5) - 4 freq daily (5) - 110 freq janila (5) - 1 freq daibelt (5) - 1 freq dunli (5) - 1 freq vanilla (5) - 6 freq denied (5) - 30 freq danger (5) - 110 freq dandie (5) - 1 freq manila (5) - 1 freq duanalla (5) - 1 freq daelt (5) - 2 freq danish (5) - 19 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 - TNLB danielb - 1 freq |
DANIELB |
| Time to execute Levenshtein function - 0.223114 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.385800 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.028644 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.040403 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.001175 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. |