| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drover (0) - 1 freq rover (1) - 12 freq droves (1) - 10 freq drove (1) - 68 freq drovers (1) - 2 freq draver (1) - 2 freq driver (1) - 92 freq dover (1) - 16 freq dreven (2) - 1 freq dooner (2) - 2 freq trove (2) - 3 freq lover (2) - 27 freq dreiver (2) - 1 freq rower (2) - 2 freq ryver (2) - 1 freq troves (2) - 1 freq river (2) - 270 freq sover (2) - 1 freq proker (2) - 1 freq rove (2) - 2 freq drone (2) - 19 freq drovit (2) - 1 freq doner (2) - 2 freq graver (2) - 1 freq drovin (2) - 3 freq |
drover (0) - 1 freq draver (1) - 2 freq driver (1) - 92 freq dryvar (2) - 1 freq dover (2) - 16 freq dreiver (2) - 1 freq drovers (2) - 2 freq droves (2) - 10 freq rover (2) - 12 freq drove (2) - 68 freq braver (3) - 4 freq draaer (3) - 2 freq dryvers (3) - 1 freq driven (3) - 58 freq dryve (3) - 2 freq daiver (3) - 4 freq praver (3) - 1 freq drier (3) - 9 freq dryer (3) - 5 freq drive (3) - 170 freq drave (3) - 61 freq dramer (3) - 2 freq draper (3) - 2 freq drives (3) - 27 freq drivel (3) - 4 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 |
DROVER |
| Time to execute Levenshtein function - 0.337630 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.642492 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.080436 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.091793 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.001226 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. |