| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wippled (0) - 2 freq rippled (1) - 1 freq wipped (1) - 1 freq kipple (2) - 2 freq nipples (2) - 7 freq wisped (2) - 1 freq wiggled (2) - 3 freq willed (2) - 4 freq hirpled (2) - 20 freq pappled (2) - 2 freq wupped (2) - 7 freq aipple (2) - 102 freq dimpled (2) - 1 freq ripple (2) - 7 freq nipped (2) - 22 freq tipple (2) - 3 freq winkled (2) - 1 freq dipped (2) - 23 freq dappled (2) - 4 freq sirpled (2) - 1 freq wiped (2) - 23 freq crippled (2) - 2 freq wiled (2) - 1 freq nipple (2) - 3 freq sappled (2) - 3 freq |
wippled (0) - 2 freq rippled (2) - 1 freq wipped (2) - 1 freq pappled (3) - 2 freq wupped (3) - 7 freq dappled (3) - 4 freq sappled (3) - 3 freq toppled (3) - 3 freq wapped (3) - 5 freq pimpled (4) - 1 freq tipped (4) - 14 freq ripples (4) - 8 freq aipples (4) - 91 freq zipped (4) - 5 freq sipped (4) - 6 freq wuppd (4) - 1 freq wheepled (4) - 3 freq applied (4) - 27 freq wuppid (4) - 1 freq supplied (4) - 8 freq rippuld (4) - 1 freq wupp'd (4) - 1 freq whipped (4) - 8 freq ripped (4) - 41 freq dimpled (4) - 1 freq |
SoundEx code - W143 wabblit - 1 freq wippled - 2 freq wobbled - 1 freq wheepled - 3 freq waffled - 1 freq wheeplit - 2 freq |
MetaPhone code - WPLT wippled - 2 freq wheepled - 3 freq wheeplit - 2 freq |
WIPPLED |
| Time to execute Levenshtein function - 0.291821 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.538315 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.060500 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.038699 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.000990 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. |