| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| derisively (0) - 1 freq decisively (1) - 1 freq definsively (2) - 1 freq devisive (3) - 2 freq evasively (3) - 2 freq negitively (3) - 1 freq defensively (3) - 1 freq definitely (3) - 120 freq decisive' (3) - 1 freq decisive (3) - 3 freq derision (4) - 8 freq delivery (4) - 49 freq persuasively (4) - 1 freq derive (4) - 2 freq divisive (4) - 7 freq erosive (4) - 1 freq positively (4) - 5 freq derived (4) - 12 freq definitly (4) - 1 freq secretively (4) - 1 freq negatively (4) - 2 freq desisien (4) - 1 freq dismissively (4) - 4 freq massively (4) - 3 freq leisurely (4) - 3 freq |
derisively (0) - 1 freq decisively (2) - 1 freq definsively (4) - 1 freq decisive (5) - 3 freq drivel (5) - 4 freq decisive' (5) - 1 freq dervel (5) - 1 freq devisive (5) - 2 freq defensively (5) - 1 freq evasively (5) - 2 freq dorisvulva (6) - 7 freq massively (6) - 3 freq deisil (6) - 1 freq definitely (6) - 120 freq derives (6) - 10 freq dervil (6) - 1 freq dursley (6) - 48 freq passively (6) - 2 freq persuasively (6) - 1 freq derval (6) - 17 freq derision (6) - 8 freq negitively (6) - 1 freq divisive (6) - 7 freq derive (6) - 2 freq derived (6) - 12 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 - TRSFL derisively - 1 freq |
DERISIVELY |
| Time to execute Levenshtein function - 0.221104 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.379817 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.028260 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.037021 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.000928 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. |