| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| draver (0) - 2 freq drawer (1) - 132 freq praver (1) - 1 freq drave (1) - 61 freq draaer (1) - 2 freq raver (1) - 4 freq braver (1) - 4 freq drover (1) - 1 freq driver (1) - 92 freq draper (1) - 2 freq graver (1) - 1 freq dramer (1) - 2 freq crater (2) - 13 freq rawer (2) - 1 freq driven (2) - 58 freq frazer (2) - 9 freq draped (2) - 16 freq ravel (2) - 2 freq haaver (2) - 4 freq raves (2) - 5 freq drier (2) - 9 freq travel (2) - 57 freq waver (2) - 1 freq davcr (2) - 1 freq fraser (2) - 72 freq |
draver (0) - 2 freq driver (1) - 92 freq drover (1) - 1 freq dryvar (2) - 1 freq draper (2) - 2 freq dramer (2) - 2 freq dreiver (2) - 1 freq graver (2) - 1 freq drawer (2) - 132 freq praver (2) - 1 freq braver (2) - 4 freq drave (2) - 61 freq raver (2) - 4 freq draaer (2) - 2 freq drove (3) - 68 freq river (3) - 270 freq droves (3) - 10 freq drives (3) - 27 freq dearer (3) - 8 freq drive (3) - 170 freq dhriver (3) - 1 freq daiver (3) - 4 freq dover (3) - 16 freq dryvers (3) - 1 freq drainer (3) - 2 freq |
SoundEx code - D616 drawbrig - 1 freq drapers - 1 freq driver - 92 freq drap-ripe - 4 freq drivers - 24 freq drappr - 1 freq drover - 1 freq driver's - 9 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 - TRFR driver - 92 freq drover - 1 freq dryvar - 1 freq draver - 2 freq dhriver - 1 freq dreiver - 1 freq €œdriver - 1 freq darfur - 1 freq trevor - 3 freq |
DRAVER |
| Time to execute Levenshtein function - 0.214839 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.369310 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.028547 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.039552 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.000908 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. |