| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| driveways (0) - 2 freq driveway (1) - 8 freq drivewye (2) - 1 freq driver's (3) - 9 freq ridgeways (3) - 1 freq onieways (3) - 1 freq drives (3) - 27 freq sideways (3) - 1 freq drivas (3) - 1 freq drivers (3) - 24 freq drive's (3) - 1 freq €˜driveway (3) - 1 freq crieffys (4) - 1 freq eyeways (4) - 1 freq trivias (4) - 1 freq ayeways (4) - 24 freq dreams (4) - 153 freq drivel (4) - 4 freq giveaway (4) - 3 freq driver (4) - 92 freq drewits (4) - 2 freq drivers' (4) - 1 freq rivets (4) - 1 freq rinaway (4) - 1 freq displays (4) - 12 freq |
driveways (0) - 2 freq driveway (2) - 8 freq drivewye (3) - 1 freq drivers (4) - 24 freq drives (4) - 27 freq drive's (4) - 1 freq drivas (4) - 1 freq doorways (5) - 2 freq derives (5) - 10 freq drovers (5) - 2 freq droves (5) - 10 freq dryvers (5) - 1 freq driver's (5) - 9 freq draws (6) - 31 freq deives (6) - 1 freq reviews (6) - 19 freq dives (6) - 7 freq crivens (6) - 8 freq previews (6) - 3 freq drivan (6) - 9 freq rives (6) - 4 freq draver's (6) - 1 freq doorweys (6) - 2 freq drive (6) - 170 freq driveen (6) - 2 freq |
SoundEx code - D612 dreeps - 13 freq droves - 10 freq dribs - 3 freq draps - 62 freq drops - 18 freq drives - 27 freq drops' - 1 freq dwarves - 6 freq dwarvies - 5 freq dwarvies' - 1 freq dervish - 2 freq dervishes - 1 freq drap's - 1 freq draabak - 1 freq draabaak - 1 freq dwarfs - 5 freq drips - 5 freq droaps - 4 freq drive's - 1 freq driveways - 2 freq drops'll - 1 freq drivas - 1 freq drawbacks - 2 freq derives - 10 freq drabbest - 1 freq drapes - 6 freq draabacks - 1 freq draaback - 2 freq droppis - 1 freq drappies - 2 freq dropsey - 1 freq drybowks - 1 freq dervock - 1 freq derbies - 2 freq drap-kickin - 1 freq |
MetaPhone code - TRFWS driveways - 2 freq |
DRIVEWAYS |
| Time to execute Levenshtein function - 0.232020 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.357823 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.027308 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.037164 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.000941 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. |