| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| desecrated (0) - 1 freq desecrate (1) - 1 freq deserted (2) - 5 freq descrived (3) - 18 freq desecration (3) - 2 freq decorated (3) - 13 freq described (3) - 33 freq deserred (3) - 2 freq consecrated (3) - 1 freq defeated (3) - 7 freq celebrated (3) - 9 freq deserved (3) - 58 freq penetrated (3) - 1 freq desperate (3) - 94 freq delegated (3) - 2 freq detected (3) - 1 freq generated (3) - 2 freq dejected (3) - 2 freq federated (3) - 1 freq secreted (3) - 1 freq dedicated (3) - 20 freq designated (3) - 6 freq serrated (3) - 1 freq descrives (4) - 14 freq restarted (4) - 1 freq |
desecrated (0) - 1 freq desecrate (2) - 1 freq deserted (3) - 5 freq secreted (4) - 1 freq described (4) - 33 freq decorated (4) - 13 freq descrived (4) - 18 freq desecration (4) - 2 freq serrated (5) - 1 freq dedicated (5) - 20 freq designated (5) - 6 freq descreeved (5) - 1 freq descrieved (5) - 1 freq descartes (5) - 3 freq descreived (5) - 4 freq discrete (5) - 3 freq distorted (5) - 2 freq escorted (5) - 1 freq deserved (5) - 58 freq deserred (5) - 2 freq desperate (5) - 94 freq detected (5) - 1 freq dejected (5) - 2 freq consecrated (5) - 1 freq desired (6) - 12 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 - TSKRTT discarded - 2 freq discardit - 3 freq desecrated - 1 freq discairdit - 1 freq |
DESECRATED |
| Time to execute Levenshtein function - 0.250810 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.459888 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.060242 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.038856 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.000926 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. |