| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| detonations (0) - 1 freq denotations (2) - 2 freq detentions (2) - 1 freq destinations (2) - 3 freq decorations (2) - 12 freq donations (2) - 2 freq derivations (3) - 2 freq devotions (3) - 4 freq intonation (3) - 11 freq desolation (3) - 2 freq destination (3) - 17 freq detention (3) - 9 freq denominations (3) - 5 freq dedications (3) - 1 freq donation (3) - 12 freq decoration (3) - 4 freq definitions (3) - 5 freq locations (4) - 9 freq delegation's (4) - 1 freq devolution (4) - 31 freq petitions (4) - 1 freq reparations (4) - 1 freq demolition (4) - 2 freq motivations (4) - 2 freq deductions (4) - 1 freq |
detonations (0) - 1 freq detentions (2) - 1 freq donations (3) - 2 freq destinations (3) - 3 freq detention (4) - 9 freq definitions (4) - 5 freq decorations (4) - 12 freq denotations (4) - 2 freq attentions (5) - 3 freq attintions (5) - 3 freq defineetions (5) - 1 freq intentions (5) - 16 freq admonitions (5) - 1 freq donation (5) - 12 freq intonation (5) - 11 freq devotions (5) - 4 freq derivations (5) - 2 freq destination (5) - 17 freq dedications (5) - 1 freq denominations (5) - 5 freq quotations (6) - 12 freq stations (6) - 10 freq depictions (6) - 2 freq situations (6) - 20 freq distinctions (6) - 2 freq |
SoundEx code - D353 didn't - 38 freq detention - 9 freq detained - 1 freq 'didn't - 1 freq da-da-n'''da-da'n'da - 1 freq deid-end - 1 freq detentions - 1 freq detonations - 1 freq diidnt - 1 freq didnt - 3 freq didnt - 3 freq |
MetaPhone code - TTNXNS detentions - 1 freq detonations - 1 freq |
DETONATIONS |
| Time to execute Levenshtein function - 0.458627 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.743169 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.256631 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.104298 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.000856 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. |