| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dentie-like (0) - 1 freq gentie-like (1) - 10 freq dentie-lik (1) - 1 freq tentie-like (1) - 1 freq tentie-lik (2) - 2 freq gentielike (2) - 1 freq pensie-like (2) - 1 freq ferlie-like (3) - 1 freq bessie-like (3) - 1 freq delytit-like (3) - 1 freq diarie-like (3) - 1 freq eerie-like (3) - 2 freq cantie-lik (3) - 1 freq dillie-like (3) - 2 freq gentil-lik (3) - 1 freq gentrie-lik (3) - 1 freq cuttie-like (3) - 1 freq cannie-like (3) - 4 freq pensie-lik (3) - 1 freq heistie-like (3) - 1 freq dowie-like (3) - 8 freq vauntie-like (3) - 3 freq tent-like (3) - 1 freq bonnie-like (3) - 1 freq forcie-like (4) - 1 freq |
dentie-like (0) - 1 freq dentie-lik (1) - 1 freq tentie-like (2) - 1 freq gentie-like (2) - 10 freq tentie-lik (3) - 2 freq tent-like (4) - 1 freq cantie-lik (4) - 1 freq vauntie-like (4) - 3 freq pensie-like (4) - 1 freq gentielike (4) - 1 freq pensie-lik (5) - 1 freq dowie-like (5) - 8 freq bonnie-like (5) - 1 freq daft-like (5) - 9 freq jynt-like (5) - 1 freq cannie-like (5) - 4 freq heistie-like (5) - 1 freq cuttie-like (5) - 1 freq diarie-like (5) - 1 freq gentil-lik (5) - 1 freq dillie-like (5) - 2 freq gentrie-lik (5) - 1 freq delytit-like (5) - 1 freq nate-lik (6) - 1 freq dwaamie-like (6) - 1 freq |
SoundEx code - D534 dandelion - 4 freq daintily - 2 freq dandelions - 1 freq dentals - 1 freq dental - 7 freq 'dental - 1 freq dentie-like - 1 freq dentie-lik - 1 freq dwindlin - 1 freq €˜dandelion - 1 freq dently - 1 freq dwindlin' - 1 freq dentily - 1 freq dwindling - 1 freq deanmadalba - 1 freq |
MetaPhone code - TNTLK dentie-like - 1 freq tentie-like - 1 freq tent-like - 1 freq tentie-lik - 2 freq dentie-lik - 1 freq |
DENTIE-LIKE |
| Time to execute Levenshtein function - 0.220012 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.392285 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.027999 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.041047 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.000927 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. |