| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| draper (0) - 2 freq drappr (1) - 1 freq draped (1) - 16 freq drapes (1) - 6 freq dramer (1) - 2 freq draaer (1) - 1 freq drapper (1) - 1 freq drapers (1) - 1 freq praper (1) - 1 freq drawer (1) - 131 freq draver (1) - 2 freq drape (1) - 1 freq prayer (2) - 95 freq drapit (2) - 1 freq proaper (2) - 3 freq daaner (2) - 1 freq crater (2) - 13 freq drap (2) - 262 freq draaed (2) - 1 freq grape (2) - 8 freq draed (2) - 1 freq rapes (2) - 1 freq frazer (2) - 9 freq dramed (2) - 2 freq grazer (2) - 1 freq |
draper (0) - 2 freq praper (2) - 1 freq drawer (2) - 131 freq draver (2) - 2 freq drappr (2) - 1 freq drapers (2) - 1 freq drape (2) - 1 freq draped (2) - 16 freq drapper (2) - 1 freq drapes (2) - 6 freq draaer (2) - 1 freq dramer (2) - 2 freq droaped (3) - 1 freq draps (3) - 61 freq drier (3) - 9 freq dapper (3) - 4 freq dumper (3) - 1 freq deeper (3) - 51 freq dipper (3) - 3 freq reaper (3) - 16 freq drapin (3) - 1 freq drapd (3) - 1 freq draar (3) - 6 freq dryer (3) - 5 freq drahr (3) - 1 freq |
SoundEx code - D616 drawbrig - 1 freq drapers - 1 freq driver - 89 freq drap-ripe - 4 freq drivers - 23 freq drappr - 1 freq drover - 1 freq driver's - 8 freq d'urbervilles - 1 freq dreeprt - 1 freq dryborough - 1 freq drapper - 1 freq dryvar - 1 freq drivers' - 1 freq draver's - 1 freq draver - 2 freq dhriver - 1 freq draper - 2 freq dryvers - 1 freq draw-brig - 1 freq drovers - 2 freq dreiver - 1 freq €œdriver - 1 freq darfur - 1 freq draabore - 1 freq driverminnie - 3 freq drbrooski - 1 freq dorriefraser - 2 freq |
MetaPhone code - TRPR trooper - 9 freq drappr - 1 freq trouper - 1 freq drapper - 1 freq tripper - 1 freq draper - 2 freq |
DRAPER |
| Time to execute Levenshtein function - 0.335263 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.521535 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.059901 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.036712 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.001926 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. |