| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wrappin (0) - 2 freq wrappin' (2) - 1 freq wrapping (2) - 6 freq wrappin (2) - 15 freq waitin (3) - 3 freq drappin (3) - 67 freq wappins (3) - 5 freq trapping (3) - 1 freq wrappit (3) - 10 freq screppin (3) - 1 freq drammin (3) - 1 freq trappins (3) - 2 freq wrappan (3) - 1 freq trappin (3) - 1 freq crapping (3) - 1 freq drapping (3) - 3 freq walkin (3) - 1 freq wappin (3) - 25 freq drappins (3) - 5 freq drappin' (3) - 2 freq rappin (3) - 6 freq crappin (3) - 11 freq lapping (4) - 1 freq bakin (4) - 1 freq wrappt (4) - 2 freq |
wrappin (0) - 2 freq wrapping (4) - 6 freq wrappin (4) - 15 freq wrappin' (4) - 1 freq screppin (5) - 1 freq wrappan (5) - 1 freq walkin (6) - 1 freq drapping (6) - 3 freq rappin (6) - 6 freq crappin (6) - 11 freq crapping (6) - 1 freq drappins (6) - 5 freq wappin (6) - 25 freq drappin' (6) - 2 freq wappins (6) - 5 freq waitin (6) - 3 freq trappin (6) - 1 freq trapping (6) - 1 freq drappin (6) - 67 freq trappins (6) - 2 freq wrappit (6) - 10 freq drammin (6) - 1 freq droppin' (7) - 1 freq droappin (7) - 8 freq wuppin (7) - 1 freq |
SoundEx code - W615 wrappin - 15 freq wrapping - 6 freq warpaint - 1 freq war-paint - 1 freq wharvin - 1 freq wire-baned - 1 freq wrappan - 1 freq whereupon - 1 freq warpin - 2 freq wrappin' - 1 freq wrappin - 2 freq werbeing - 2 freq |
MetaPhone code - RPN wrappin - 15 freq rappin - 6 freq rippin - 21 freq rypin - 5 freq repone - 68 freq reapin - 4 freq ripin - 3 freq roupin - 4 freq ripen - 8 freq rippen - 5 freq rapin - 2 freq rïppin - 1 freq rypan - 1 freq raepin - 3 freq wrappan - 1 freq ropin - 1 freq repon - 8 freq re-appen - 1 freq rippan - 1 freq rippin' - 1 freq wrappin' - 1 freq wrappin - 2 freq re-open - 1 freq reopen - 1 freq |
WRAPPIN |
| Time to execute Levenshtein function - 0.213728 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.371935 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.027586 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.040946 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.000853 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. |