| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drivewye (0) - 1 freq driveways (2) - 2 freq driveway (2) - 8 freq driven (3) - 58 freq daveye (3) - 1 freq drivers (3) - 24 freq drive (3) - 170 freq oniewye (3) - 7 freq drivers' (3) - 1 freq driver (3) - 92 freq driveen (3) - 2 freq drivel (3) - 4 freq diverse (3) - 24 freq drives (3) - 27 freq drewie (3) - 1 freq riverse (3) - 1 freq drive's (3) - 1 freq driver's (3) - 9 freq pricey (4) - 4 freq drivin' (4) - 1 freq crewe (4) - 2 freq divorce (4) - 15 freq dreven (4) - 1 freq gravely (4) - 12 freq ivery (4) - 188 freq |
drivewye (0) - 1 freq driveway (2) - 8 freq driveways (3) - 2 freq drivel (4) - 4 freq drives (4) - 27 freq driver (4) - 92 freq drewie (4) - 1 freq driveen (4) - 2 freq driven (4) - 58 freq drive (4) - 170 freq drove (5) - 68 freq drowie (5) - 5 freq drowe (5) - 8 freq dreiver (5) - 1 freq draver (5) - 2 freq dreive (5) - 4 freq dreven (5) - 1 freq droves (5) - 10 freq derive (5) - 2 freq drivan (5) - 9 freq drivas (5) - 1 freq drave (5) - 61 freq drew (5) - 194 freq derives (5) - 10 freq derived (5) - 12 freq |
SoundEx code - D610 drove - 68 freq drap - 265 freq drave - 61 freq droap - 11 freq drive - 170 freq dryope - 1 freq drappie - 17 freq dreep - 26 freq drop - 39 freq 'drap - 1 freq droopy - 2 freq drivewye - 1 freq drab - 7 freq driv - 12 freq dryve - 2 freq dry'v - 1 freq droop - 2 freq drip - 12 freq dwarf - 3 freq derby - 13 freq drehve - 1 freq derf - 2 freq dreef - 4 freq driveway - 8 freq dræv - 2 freq dhrive - 4 freq dhriv - 5 freq drehv - 1 freq derbie - 2 freq 'derby - 1 freq droppy - 1 freq derive - 2 freq dryhope - 2 freq drape - 1 freq €˜drappie - 1 freq €œdrive - 1 freq dreip - 2 freq dreive - 4 freq €œdrop - 1 freq €˜driveway - 1 freq druv - 1 freq drf - 1 freq drippy - 1 freq drfw - 1 freq dearbh - 1 freq 'dreef' - 1 freq |
MetaPhone code - TRFY drivewye - 1 freq |
DRIVEWYE |
| Time to execute Levenshtein function - 0.207853 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.400294 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.032065 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.043110 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.001092 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. |