| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| drwsv (0) - 1 freq dows (2) - 1 freq rws (2) - 17 freq druv (2) - 1 freq daws (2) - 5 freq dowse (2) - 2 freq dry'v (2) - 1 freq drqs (2) - 1 freq drush (2) - 7 freq dress (2) - 98 freq driv (2) - 12 freq drehv (2) - 1 freq dræv (2) - 2 freq wjwsv (2) - 1 freq draws (2) - 31 freq drowsy (2) - 1 freq dross (2) - 18 freq rys (3) - 3 freq adews (3) - 1 freq dhraws (3) - 1 freq rfv (3) - 1 freq dreid (3) - 51 freq draw'd (3) - 1 freq dash (3) - 32 freq dads (3) - 19 freq |
drwsv (0) - 1 freq draws (3) - 31 freq drowsy (3) - 1 freq driv (4) - 12 freq drehv (4) - 1 freq wjwsv (4) - 1 freq dross (4) - 18 freq dress (4) - 98 freq dræv (4) - 2 freq druv (4) - 1 freq rws (4) - 17 freq drush (4) - 7 freq daws (4) - 5 freq dows (4) - 1 freq dowse (4) - 2 freq dry'v (4) - 1 freq drqs (4) - 1 freq drywyn (5) - 1 freq drove (5) - 68 freq drars (5) - 2 freq drems (5) - 1 freq draas (5) - 13 freq dries (5) - 8 freq drawn (5) - 90 freq drowt (5) - 1 freq |
SoundEx code - D621 door-gap - 1 freq daurk-broon - 2 freq drug-fuelled - 1 freq derisively - 1 freq doricaubergine - 1 freq doricbananaman - 1 freq doricbanter - 1 freq doricphrases - 139 freq doorsopendays - 1 freq derekofhighbury - 1 freq dorisvulva - 7 freq diraaxvzyp - 1 freq derekbateman - 2 freq derickfaeyell - 2 freq drrosebland - 2 freq drakeford - 1 freq driseborough - 1 freq drawzfj - 2 freq drwsv - 1 freq |
MetaPhone code - TRSF tyresoff - 1 freq trsve - 1 freq drwsv - 1 freq |
DRWSV |
| Time to execute Levenshtein function - 0.250368 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.374225 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.028114 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.000866 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. |