| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drovers (0) - 2 freq rovers (1) - 23 freq droves (1) - 10 freq drover (1) - 1 freq dryvers (1) - 1 freq drivers (1) - 24 freq proverb (2) - 7 freq drawers (2) - 52 freq grocers (2) - 3 freq drapers (2) - 1 freq dra'ers (2) - 2 freq doves (2) - 2 freq groves (2) - 2 freq covers (2) - 51 freq drive's (2) - 1 freq dooners (2) - 2 freq drones (2) - 14 freq proves (2) - 14 freq drivers' (2) - 1 freq dover (2) - 16 freq draver's (2) - 1 freq clovers (2) - 2 freq draver (2) - 2 freq oldrovers (2) - 1 freq draaers (2) - 3 freq |
drovers (0) - 2 freq dryvers (1) - 1 freq drivers (1) - 24 freq rovers (2) - 23 freq droves (2) - 10 freq drover (2) - 1 freq driver (3) - 92 freq oldrovers (3) - 1 freq draver's (3) - 1 freq driver's (3) - 9 freq draver (3) - 2 freq divers (3) - 10 freq dramers (3) - 1 freq travers (3) - 4 freq drivers' (3) - 1 freq rivers (3) - 30 freq drives (3) - 27 freq do-overs (3) - 1 freq draaers (3) - 3 freq dra'ers (3) - 2 freq drapers (3) - 1 freq drive's (3) - 1 freq drawers (3) - 52 freq forivers (4) - 1 freq drars (4) - 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 - TRFRS drivers - 24 freq driver's - 9 freq travers - 4 freq drivers' - 1 freq draver's - 1 freq traverse - 9 freq dryvers - 1 freq drovers - 2 freq |
DROVERS |
| Time to execute Levenshtein function - 0.267538 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.399752 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.028645 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.040415 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.000925 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. |