| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drappins (0) - 5 freq drappin (1) - 68 freq drapping (1) - 3 freq drappies (1) - 2 freq trappins (1) - 2 freq drappin' (1) - 2 freq drappan (2) - 1 freq drawins (2) - 11 freq drappitd (2) - 1 freq drappie (2) - 17 freq droppings (2) - 1 freq crappin (2) - 11 freq wrappin' (2) - 1 freq wrappin (2) - 16 freq drappit (2) - 93 freq drapples (2) - 2 freq dropping (2) - 2 freq droppin' (2) - 1 freq yappins (2) - 1 freq drains (2) - 10 freq drpping (2) - 1 freq dhrappin (2) - 1 freq droppis (2) - 1 freq dripping (2) - 2 freq trappin (2) - 1 freq |
drappins (0) - 5 freq trappins (2) - 2 freq drappies (2) - 2 freq drappin' (2) - 2 freq drapping (2) - 3 freq drappin (2) - 68 freq droppis (3) - 1 freq droppin (3) - 8 freq dropping (3) - 2 freq dripping (3) - 2 freq droppin' (3) - 1 freq drapples (3) - 2 freq drippin (3) - 23 freq droappin (3) - 8 freq droppings (3) - 1 freq drpping (3) - 1 freq drappan (3) - 1 freq trapping (4) - 1 freq wappins (4) - 5 freq draains (4) - 5 freq drapin (4) - 1 freq dreippin (4) - 1 freq droppan (4) - 3 freq drippan (4) - 5 freq wrapping (4) - 6 freq |
SoundEx code - D615 dreepin - 66 freq drappin - 68 freq drippin - 23 freq droappin - 8 freq drapin - 1 freq drivin - 104 freq driven - 58 freq dreipin - 4 freq drippan - 5 freq drovin - 3 freq droppin' - 1 freq driving - 19 freq dreeping - 1 freq droppin - 8 freq dhrappin - 1 freq dripping - 2 freq drypoint - 1 freq drehvin - 1 freq drappin' - 2 freq droppan - 3 freq driveen - 2 freq drivan - 9 freq drappan - 1 freq droppings - 1 freq drappins - 5 freq dripeen - 1 freq dhriven - 3 freq driyvin - 1 freq drüben - 1 freq dravin - 4 freq dreippin - 1 freq dreven - 1 freq drapping - 3 freq drpping - 1 freq dreivin - 1 freq dropping - 2 freq droopin - 1 freq dripin - 1 freq derivin - 1 freq drivven - 1 freq drivin' - 1 freq |
MetaPhone code - TRPNS trippin's - 1 freq trappins - 2 freq drappins - 5 freq |
DRAPPINS |
| Time to execute Levenshtein function - 0.196956 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.402240 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.027197 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.036832 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.000918 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. |