| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| desecrate (0) - 1 freq desecrated (1) - 1 freq desperate (2) - 94 freq desolate (3) - 3 freq generate (3) - 4 freq penetrate (3) - 6 freq desert (3) - 60 freq descreve (3) - 1 freq democrats (3) - 17 freq eelebrate (3) - 1 freq deserted (3) - 5 freq descrive (3) - 25 freq seperate (3) - 2 freq describe (3) - 43 freq delegate (3) - 3 freq decorate (3) - 5 freq deserve (3) - 65 freq celebrate (3) - 87 freq delicate (3) - 21 freq descryve (3) - 2 freq democratie (3) - 3 freq deserts (3) - 8 freq denigrate (3) - 2 freq discrete (3) - 3 freq desecration (3) - 2 freq |
desecrate (0) - 1 freq desecrated (2) - 1 freq discrete (3) - 3 freq desperate (3) - 94 freq descryve (4) - 2 freq desecration (4) - 2 freq democratie (4) - 3 freq describe (4) - 43 freq disparate (4) - 2 freq descraib (4) - 1 freq democrat (4) - 5 freq decorate (4) - 5 freq desert (4) - 60 freq descrive (4) - 25 freq descreve (4) - 1 freq dessert (5) - 4 freq desprit (5) - 3 freq descrieve (5) - 8 freq desprait (5) - 2 freq descreive (5) - 3 freq secret (5) - 198 freq discreet (5) - 5 freq desirit (5) - 3 freq scrat (5) - 31 freq despert (5) - 4 freq |
SoundEx code - D226 dishwasher - 3 freq disagree - 35 freq disagreement - 3 freq dishwaasher - 1 freq disagreed - 4 freq disagrees - 3 freq disagreein - 1 freq disagreemint - 1 freq desecrated - 1 freq desecrate - 1 freq disagreements - 1 freq dish-waashers - 1 freq desecration - 2 freq disease-ridden - 1 freq dishwashir - 1 freq disagreh - 1 freq |
MetaPhone code - TSKRT discreet - 5 freq disagreed - 4 freq discrete - 3 freq discord - 5 freq desecrate - 1 freq discaird - 1 freq discard - 1 freq |
DESECRATE |
| Time to execute Levenshtein function - 0.909682 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 - 1.693075 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.201387 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.201326 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.001207 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. |