| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jerkily (0) - 1 freq merrily (2) - 5 freq eerily (2) - 1 freq hertily (2) - 2 freq merkitly (2) - 1 freq verily (2) - 2 freq jerkin (2) - 2 freq derkly (2) - 1 freq reekily (2) - 1 freq werkin (3) - 2 freq erly (3) - 3 freq ferly (3) - 20 freq jeskit (3) - 1 freq wergild (3) - 2 freq aerly (3) - 19 freq merkins (3) - 1 freq femily (3) - 21 freq jersey (3) - 22 freq jerries (3) - 11 freq jenkins (3) - 4 freq sneakily (3) - 4 freq herkin (3) - 3 freq jervis (3) - 1 freq defily (3) - 1 freq merkid (3) - 2 freq |
jerkily (0) - 1 freq derkly (3) - 1 freq jerkin (3) - 2 freq reekily (3) - 1 freq jerkt (4) - 1 freq jerk (4) - 8 freq hurkil (4) - 1 freq darkly (4) - 2 freq berkeley (4) - 3 freq jerks (4) - 1 freq jerked (4) - 6 freq merkel (4) - 1 freq jerkan (4) - 1 freq merkitly (4) - 1 freq hertily (4) - 2 freq eerily (4) - 1 freq merrily (4) - 5 freq sirkil (4) - 1 freq verily (4) - 2 freq pawkily (5) - 2 freq warily (5) - 3 freq jeremy (5) - 12 freq erdly (5) - 1 freq yerkin (5) - 4 freq derkies (5) - 1 freq |
SoundEx code - J624 jerusalem - 103 freq jargle - 1 freq jerkily - 1 freq jerusalem' - 1 freq €œjerusalem - 1 freq |
MetaPhone code - JRKL jargle - 1 freq jerkily - 1 freq |
JERKILY |
| Time to execute Levenshtein function - 0.222451 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.388801 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.028048 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.037132 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.000805 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. |