| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ripple (0) - 7 freq tipple (1) - 3 freq aipple (1) - 102 freq nipple (1) - 3 freq ripples (1) - 8 freq cripple (1) - 6 freq kipple (1) - 2 freq rippled (1) - 1 freq tripple (1) - 1 freq riffle (2) - 1 freq trapple (2) - 3 freq rippen (2) - 5 freq rippet (2) - 7 freq simple (2) - 205 freq cupple (2) - 2 freq grippie (2) - 7 freq apple (2) - 30 freq ripplan (2) - 2 freq rippek (2) - 2 freq ripper (2) - 10 freq riddle (2) - 32 freq cripples (2) - 1 freq ripplit (2) - 1 freq aiple (2) - 5 freq fripples (2) - 1 freq |
ripple (0) - 7 freq kipple (2) - 2 freq tripple (2) - 1 freq cripple (2) - 6 freq rippled (2) - 1 freq aipple (2) - 102 freq tipple (2) - 3 freq nipple (2) - 3 freq ripples (2) - 8 freq ripped (3) - 41 freq papple (3) - 1 freq ripplin (3) - 12 freq rippit (3) - 15 freq rippin (3) - 21 freq dapple (3) - 2 freq rippan (3) - 1 freq grapple (3) - 2 freq rippa (3) - 4 freq epple (3) - 13 freq sapple (3) - 1 freq rippuld (3) - 1 freq topple (3) - 1 freq supple (3) - 6 freq rippek (3) - 2 freq ripplan (3) - 2 freq |
SoundEx code - R140 reply - 165 freq rope-will - 2 freq raffle - 13 freq rouble - 7 freq rebel - 27 freq rifle - 24 freq rabble - 10 freq ravel - 2 freq rubble - 7 freq ripple - 7 freq rebelle - 1 freq repel - 2 freq ruffle - 5 freq reveal - 21 freq refull - 1 freq replay - 5 freq rival - 14 freq refill - 3 freq ravioli - 1 freq 'ravioli - 2 freq rifle' - 2 freq reffel - 2 freq 'rabelo' - 1 freq riffle - 1 freq revile - 3 freq raivel - 3 freq raip-haul - 1 freq rop-will - 1 freq revell - 1 freq raifall - 1 freq raphaell - 1 freq rope'll - 1 freq 'rebel - 1 freq reveille - 1 freq 'revel' - 1 freq ruefully - 3 freq revel - 2 freq rewable - 1 freq |
MetaPhone code - RPL reply - 165 freq ripple - 7 freq repel - 2 freq replay - 5 freq rope'll - 1 freq |
RIPPLE |
| Time to execute Levenshtein function - 0.235584 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.684664 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.058255 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.037878 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.000866 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. |