| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| daveraver (0) - 2 freq draver (3) - 2 freq avever (3) - 1 freq tavernier (3) - 1 freq davered (3) - 1 freq average (3) - 29 freq waverers (4) - 1 freq depraved (4) - 1 freq daaner (4) - 1 freq darker (4) - 9 freq darger (4) - 2 freq dairker (4) - 1 freq diverse (4) - 24 freq darenae (4) - 4 freq server (4) - 2 freq dramer (4) - 2 freq daiver (4) - 4 freq averse (4) - 6 freq havenae (4) - 20 freq debater (4) - 1 freq avera (4) - 1 freq daenae (4) - 4 freq diverted (4) - 1 freq derived (4) - 12 freq guverner (4) - 1 freq |
daveraver (0) - 2 freq draver (4) - 2 freq doonriver (5) - 2 freq dhriver (5) - 1 freq drover (5) - 1 freq dreiver (5) - 1 freq driver (5) - 92 freq avever (5) - 1 freq davered (5) - 1 freq tavernier (5) - 1 freq draaer (6) - 2 freq fariver (6) - 10 freq deserves (6) - 33 freq davygavin (6) - 33 freq verve (6) - 2 freq savwver (6) - 1 freq braver (6) - 4 freq carver (6) - 14 freq drave (6) - 61 freq derive (6) - 2 freq favarger (6) - 1 freq deserve (6) - 65 freq dryvar (6) - 1 freq dearer (6) - 8 freq dovered (6) - 6 freq |
SoundEx code - D161 deprive - 3 freq deprived - 7 freq deprivation - 11 freq deprives - 1 freq deprivin - 1 freq depravity - 2 freq deprivat - 1 freq day-afore-peyday - 1 freq debrief - 1 freq dabarbuckle - 3 freq depraved - 1 freq daveraver - 2 freq |
MetaPhone code - TFRFR daveraver - 2 freq |
DAVERAVER |
| Time to execute Levenshtein function - 0.302079 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.715144 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.079294 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.090894 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.000855 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. |