| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dalnoid (0) - 6 freq tannoid (2) - 1 freq avoid (3) - 54 freq pallid (3) - 1 freq waantid (3) - 2 freq albeid (3) - 1 freq almond (3) - 4 freq damned (3) - 39 freq dalyrd (3) - 1 freq allood (3) - 7 freq dansin (3) - 14 freq mallord (3) - 1 freq dancis (3) - 2 freq dauntin (3) - 4 freq alooin (3) - 1 freq david (3) - 230 freq falloed (3) - 1 freq droid (3) - 1 freq bannid (3) - 1 freq mastoid (3) - 1 freq paranoid (3) - 12 freq alloud (3) - 1 freq dawnit (3) - 3 freq daintie (3) - 1 freq alooed (3) - 2 freq |
dalnoid (0) - 6 freq daled (4) - 5 freq dawned (4) - 13 freq dalin (4) - 4 freq darned (4) - 2 freq dallied (4) - 1 freq dalyrd (4) - 1 freq dandie (4) - 1 freq damned (4) - 39 freq tannoid (4) - 1 freq deluded (5) - 1 freq dilled (5) - 3 freq daavid (5) - 12 freq droond (5) - 5 freq lndia (5) - 1 freq delled (5) - 2 freq drained (5) - 22 freq talentid (5) - 1 freq dandy (5) - 37 freq dailin (5) - 1 freq dolled (5) - 6 freq delayin (5) - 3 freq dali (5) - 5 freq dawnin (5) - 7 freq daid (5) - 5 freq |
SoundEx code - D453 dalmatians - 4 freq dalmatian - 1 freq doolander - 1 freq dalmations - 3 freq dalnoid - 6 freq dolomites - 1 freq |
MetaPhone code - TLNT talent - 59 freq taloned - 1 freq tland - 3 freq tailend - 1 freq dalnoid - 6 freq |
DALNOID |
| Time to execute Levenshtein function - 0.186112 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.340811 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.028305 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.038348 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.000843 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. |