| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drivers (0) - 23 freq drives (1) - 27 freq drive's (1) - 1 freq dryvers (1) - 1 freq driver's (1) - 8 freq driver (1) - 89 freq divers (1) - 10 freq drovers (1) - 2 freq drivers' (1) - 1 freq rivers (1) - 30 freq dhriver (2) - 1 freq forivers (2) - 1 freq rovers (2) - 23 freq daiver (2) - 4 freq diners (2) - 1 freq dra'ers (2) - 2 freq river's (2) - 7 freq slivers (2) - 5 freq dreiver (2) - 1 freq driven (2) - 58 freq i'rivers (2) - 2 freq haivers (2) - 31 freq dailers (2) - 2 freq crivens (2) - 8 freq diverts (2) - 2 freq |
drivers (0) - 23 freq drovers (1) - 2 freq dryvers (1) - 1 freq rivers (2) - 30 freq divers (2) - 10 freq drivers' (2) - 1 freq driver (2) - 89 freq drives (2) - 27 freq drive's (2) - 1 freq driver's (2) - 8 freq reivers (3) - 17 freq draver's (3) - 1 freq travers (3) - 4 freq droves (3) - 10 freq derives (3) - 10 freq rievers (3) - 1 freq 'reivers (3) - 1 freq drivas (3) - 1 freq draaers (3) - 3 freq dramers (3) - 1 freq delivers (3) - 2 freq drover (3) - 1 freq diverse (3) - 24 freq draver (3) - 2 freq riverse (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 - TRFRS drivers - 23 freq driver's - 8 freq travers - 4 freq drivers' - 1 freq draver's - 1 freq traverse - 9 freq dryvers - 1 freq drovers - 2 freq |
DRIVERS |
| Time to execute Levenshtein function - 0.222125 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.354772 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.027162 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.036979 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.000867 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. |