| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| detention (0) - 10 freq detentions (1) - 1 freq peteetion (2) - 3 freq intention (2) - 24 freq peteition (2) - 1 freq attention (2) - 183 freq detectin (2) - 1 freq desertion (2) - 2 freq deletion (2) - 1 freq dejection (2) - 2 freq detector (3) - 7 freq essention (3) - 1 freq stentin (3) - 2 freq depiction (3) - 3 freq detective (3) - 23 freq invention (3) - 22 freq peteetions (3) - 1 freq dementia (3) - 9 freq detestit (3) - 1 freq dimension (3) - 11 freq attentioun (3) - 1 freq dentition (3) - 1 freq attentions (3) - 3 freq digestion (3) - 1 freq desertin (3) - 2 freq |
detention (0) - 10 freq detentions (2) - 1 freq detectin (3) - 1 freq attention (3) - 183 freq intention (3) - 24 freq tentin (4) - 10 freq detonations (4) - 1 freq attentioun (4) - 1 freq attintion (4) - 3 freq stentin (4) - 2 freq definition (4) - 30 freq dejection (4) - 2 freq peteition (4) - 1 freq peteetion (4) - 3 freq desertion (4) - 2 freq deletion (4) - 1 freq destination (4) - 19 freq intentions (5) - 17 freq dottin (5) - 1 freq extension (5) - 11 freq dependin (5) - 26 freq defendin (5) - 9 freq dementit (5) - 22 freq petition (5) - 11 freq edeetion (5) - 12 freq |
SoundEx code - D353 didn't - 39 freq detention - 10 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 - TTNXN detention - 10 freq |
DETENTION |
| Time to execute Levenshtein function - 0.201759 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.355483 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.028016 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.037653 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.000897 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. |