| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cucumber-frames (0) - 5 freq cucumber-frame (1) - 1 freq number-plates (6) - 1 freq cucumber (7) - 13 freq chair-frame (7) - 1 freq windae-frames (7) - 1 freq umberellaes (7) - 1 freq robertjames (8) - 1 freq cattie-faces (8) - 9 freq crowberries (8) - 1 freq encumbered (8) - 1 freq uberfacts (8) - 1 freq crumb-aware (8) - 1 freq furlierorams (8) - 1 freq bucketfaes (8) - 1 freq documentaries (8) - 5 freq cucumbersandwiches (8) - 1 freq aulder-anes (8) - 2 freq chambermaids (8) - 1 freq chimley-brace (8) - 1 freq umberellae (8) - 5 freq cumberland's (8) - 1 freq cumberland (8) - 6 freq fause-faces (8) - 1 freq campbell-frazer (8) - 2 freq |
cucumber-frames (0) - 5 freq cucumber-frame (2) - 1 freq chair-frame (11) - 1 freq number-plates (11) - 1 freq cucumber (12) - 13 freq windae-frames (12) - 1 freq cumberland's (13) - 1 freq crumb-aware (13) - 1 freq chambermaids (13) - 1 freq crowberries (13) - 1 freq umberellaes (13) - 1 freq cumbernauld (14) - 4 freq timeframe (14) - 1 freq schirefdomes (14) - 1 freq chambers (14) - 8 freq circumferences (14) - 1 freq come-affs (14) - 1 freq december's (14) - 3 freq tuim-wames (14) - 2 freq caur-parks (14) - 1 freq care-free (14) - 1 freq chamber's (14) - 1 freq bomb-faas (14) - 1 freq embarrass (14) - 10 freq bar-rooms (14) - 1 freq |
SoundEx code - C251 cucumber - 13 freq cucumber-frames - 5 freq chickenpox - 1 freq casanova - 1 freq cosmopolitan - 3 freq cucumber-frame - 1 freq cickenpox - 1 freq cosyin-up - 1 freq cushion-plumped - 1 freq 'cosmopolitan - 1 freq cookin-pat - 2 freq co-convenor - 1 freq chuckinbroth - 1 freq cucumbersandwiches - 1 freq casumptious - 1 freq cockwomble - 3 freq |
MetaPhone code - KKMRFRMS cucumber-frames - 5 freq |
CUCUMBER-FRAMES |
| Time to execute Levenshtein function - 0.333461 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.476894 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.030798 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.039449 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.000966 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. |