| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wrapping (0) - 6 freq crapping (1) - 1 freq trapping (1) - 1 freq wrappin (1) - 15 freq drapping (1) - 3 freq wrappin' (1) - 1 freq wrappin (2) - 2 freq snapping (2) - 1 freq rappin (2) - 6 freq trappin (2) - 1 freq grasping (2) - 2 freq happing (2) - 1 freq whipping (2) - 2 freq yapping (2) - 5 freq lapping (2) - 1 freq crappin (2) - 11 freq prepping (2) - 1 freq tripping (2) - 3 freq dropping (2) - 2 freq napping (2) - 1 freq ripping (2) - 1 freq wappin (2) - 25 freq dripping (2) - 2 freq drappins (2) - 5 freq drappin' (2) - 2 freq |
wrapping (0) - 6 freq crapping (2) - 1 freq wrappin' (2) - 1 freq drapping (2) - 3 freq wrappin (2) - 15 freq trapping (2) - 1 freq dropping (3) - 2 freq tripping (3) - 3 freq ripping (3) - 1 freq prepping (3) - 1 freq drpping (3) - 1 freq dripping (3) - 2 freq wrappan (3) - 1 freq whipping (3) - 2 freq propping (3) - 1 freq repping (3) - 1 freq wappins (4) - 5 freq wrappit (4) - 10 freq scrapping (4) - 2 freq drappin (4) - 67 freq slapping (4) - 4 freq trappins (4) - 2 freq chapping (4) - 5 freq clapping (4) - 3 freq stapping (4) - 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 - RPNK wrapping - 6 freq repping - 1 freq ripping - 1 freq |
WRAPPING |
| Time to execute Levenshtein function - 0.197061 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.382681 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.027783 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.038492 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.000980 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. |