| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dillie-like (0) - 2 freq diarie-like (2) - 1 freq ferlie-like (3) - 1 freq dentie-like (3) - 1 freq dowie-like (3) - 8 freq dentie-lik (4) - 1 freq gentie-like (4) - 10 freq lassie-like (4) - 1 freq aiverie-like (4) - 4 freq wise-like (4) - 3 freq still-like (4) - 1 freq blate-like (4) - 16 freq willintlie (4) - 2 freq tentie-like (4) - 1 freq douce-like (4) - 8 freq primsie-like (4) - 1 freq mellow-like (4) - 1 freq fierce-like (4) - 1 freq delytit-like (4) - 1 freq gutsie-like (4) - 1 freq skeelie-like (4) - 2 freq awfie-like (4) - 1 freq pensie-like (4) - 1 freq dwaamie-like (4) - 1 freq cuttie-like (4) - 1 freq |
dillie-like (0) - 2 freq diarie-like (4) - 1 freq ill-lik (5) - 1 freq dowie-like (5) - 8 freq dentie-like (5) - 1 freq ferlie-like (5) - 1 freq uncle-like (6) - 1 freq dwaamie-like (6) - 1 freq delytit-like (6) - 1 freq skeelie-like (6) - 2 freq ill-luk (6) - 1 freq delf-lik (6) - 1 freq mellow-like (6) - 1 freq deil-lake (6) - 1 freq lillie-leaf (6) - 1 freq ideal-like (6) - 1 freq blate-like (6) - 16 freq still-like (6) - 1 freq dentie-lik (6) - 1 freq douce-like (6) - 8 freq gentie-like (7) - 10 freq aiverie-like (7) - 4 freq lyfie-lik (7) - 1 freq gleyt-like (7) - 1 freq ill-laek (7) - 2 freq |
SoundEx code - D442 dillie-like - 2 freq |
MetaPhone code - TLLK deil-lake - 1 freq dillie-like - 2 freq |
DILLIE-LIKE |
| Time to execute Levenshtein function - 0.395806 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.796773 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.084075 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.041066 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.000853 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. |