| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ultimately (0) - 13 freq intimately (2) - 1 freq ultimate (2) - 11 freq ultimatum (3) - 2 freq untimely (3) - 5 freq ultamitly (3) - 1 freq cultivated (4) - 1 freq lately (4) - 57 freq estimates (4) - 1 freq climate (4) - 34 freq estimated (4) - 1 freq stately (4) - 8 freq climate's (4) - 1 freq legitimately (4) - 1 freq cultivate (4) - 2 freq blately (4) - 2 freq ultima (4) - 4 freq climates (4) - 6 freq intimate (4) - 10 freq alternately (4) - 1 freq timely (4) - 4 freq privately (4) - 2 freq estimate (4) - 4 freq delicately (4) - 4 freq €˜timely (4) - 1 freq |
ultimately (0) - 13 freq ultimate (3) - 11 freq ultamitly (3) - 1 freq intimately (3) - 1 freq ultimatum (4) - 2 freq untimely (5) - 5 freq legitimately (5) - 1 freq intimate (6) - 10 freq alternately (6) - 1 freq estimate (6) - 4 freq timely (6) - 4 freq ultima (6) - 4 freq estimates (6) - 1 freq estimated (6) - 1 freq lately (6) - 57 freq stately (6) - 8 freq remotely (7) - 3 freq lightly (7) - 6 freq estimatit (7) - 2 freq estimabil (7) - 1 freq flatmates (7) - 1 freq limited (7) - 19 freq timidly (7) - 16 freq limply (7) - 1 freq listly (7) - 1 freq |
SoundEx code - U435 ultimately - 13 freq ultimate - 11 freq ull-deeins - 2 freq ultima - 4 freq ultimatum - 2 freq ultamitly - 1 freq |
MetaPhone code - ULTMTL ultimately - 13 freq ultamitly - 1 freq |
ULTIMATELY |
| Time to execute Levenshtein function - 0.300584 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.514013 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.057983 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.036952 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.000813 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. |