| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keystrokes (0) - 1 freq strokes (3) - 7 freq gemstones (4) - 1 freq keyholes (4) - 2 freq destroys (4) - 3 freq bestrides (4) - 1 freq keystraik (4) - 1 freq strikes (4) - 20 freq destroyed (4) - 18 freq peypokes (4) - 1 freq trokes (4) - 1 freq keysies (4) - 1 freq stroks (4) - 1 freq kestrel (4) - 2 freq destroyer (4) - 3 freq stroke (4) - 31 freq stroked (4) - 11 freq pey-pokes (4) - 3 freq eastboxes (4) - 1 freq strakes (4) - 1 freq oestrogen (4) - 1 freq restores (4) - 2 freq keystane (4) - 3 freq stokes (4) - 2 freq drystones (4) - 1 freq |
keystrokes (0) - 1 freq strokes (4) - 7 freq keystraik (5) - 1 freq stroks (5) - 1 freq strikes (5) - 20 freq strakes (5) - 1 freq stroke (6) - 31 freq kestrel (6) - 2 freq straks (6) - 1 freq stroked (6) - 11 freq stokes (6) - 2 freq restores (6) - 2 freq striks (6) - 2 freq destroys (6) - 3 freq trokes (6) - 1 freq bestrides (6) - 1 freq stres (7) - 1 freq stroans (7) - 1 freq strokin (7) - 6 freq striker (7) - 6 freq stroods (7) - 3 freq pastries (7) - 1 freq kintraes (7) - 8 freq strokit (7) - 3 freq stakes (7) - 6 freq |
SoundEx code - K236 kist-drawer - 1 freq kick-started - 1 freq kickstart - 2 freq keek-through - 1 freq kick-stairt - 1 freq keystrokes - 1 freq keystraik - 1 freq kestrel - 2 freq kagdrtlood - 1 freq kwqtr - 2 freq |
MetaPhone code - KSTRKS keystrokes - 1 freq |
KEYSTROKES |
| Time to execute Levenshtein function - 0.267836 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.431297 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.028765 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.038557 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.000872 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. |