| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| driver (0) - 89 freq dhriver (1) - 1 freq drivel (1) - 3 freq diver (1) - 5 freq daiver (1) - 4 freq drover (1) - 1 freq dreiver (1) - 1 freq drive (1) - 167 freq drivers (1) - 23 freq driven (1) - 58 freq drives (1) - 27 freq river (1) - 264 freq drier (1) - 9 freq draver (1) - 2 freq brier (2) - 5 freq drawer (2) - 131 freq dries (2) - 8 freq siver (2) - 2 freq rivers (2) - 30 freq divers (2) - 10 freq drivin (2) - 102 freq drivers' (2) - 1 freq dover (2) - 15 freq 'niver (2) - 2 freq deliver (2) - 46 freq |
driver (0) - 89 freq dreiver (1) - 1 freq drover (1) - 1 freq draver (1) - 2 freq river (2) - 264 freq dryvar (2) - 1 freq dhriver (2) - 1 freq daiver (2) - 4 freq drives (2) - 27 freq drier (2) - 9 freq drivel (2) - 3 freq driven (2) - 58 freq drive (2) - 167 freq diver (2) - 5 freq drivers (2) - 23 freq drove (3) - 68 freq dreven (3) - 1 freq drainer (3) - 2 freq graver (3) - 1 freq draaer (3) - 1 freq dramer (3) - 2 freq ryver (3) - 1 freq drivas (3) - 1 freq firiver (3) - 2 freq dryer (3) - 5 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 - TRFR driver - 89 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 |
DRIVER |
| Time to execute Levenshtein function - 0.184910 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.393339 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.058854 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.039334 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.000791 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. |