| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| didnt (0) - 3 freq didnt (2) - 3 freq dont (2) - 14 freq didn't (2) - 39 freq isnt (2) - 2 freq aint (2) - 1 freq din't (3) - 4 freq diidnt (3) - 1 freq dinnit (3) - 1 freq didnay (3) - 2 freq fins (3) - 1 freq wont (3) - 5 freq dirs (3) - 2 freq dingit (3) - 13 freq cant (3) - 11 freq didna (3) - 1636 freq dignit (3) - 1 freq disn't (3) - 4 freq widv (3) - 1 freq 'didn't (3) - 1 freq mins (3) - 2 freq didno (3) - 17 freq dics (3) - 1 freq fin (3) - 1 freq dinnet (3) - 1 freq |
didnt (0) - 3 freq dont (3) - 14 freq doesnt (4) - 7 freq isnt (4) - 2 freq aint (4) - 1 freq didnt (4) - 3 freq didn't (4) - 39 freq wasnt (5) - 1 freq dont (5) - 1 freq cant (5) - 11 freq wont (5) - 5 freq diidnt (5) - 1 freq dads (5) - 1 freq arent (5) - 1 freq kent (5) - 1 freq divn't (6) - 4 freq disnt (6) - 1 freq didne (6) - 1 freq ding't (6) - 2 freq didn (6) - 25 freq werent (6) - 1 freq durin (6) - 1 freq kiddin (6) - 1 freq couldnt (6) - 1 freq damiens (6) - 1 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 - TTNT didn't - 39 freq detained - 1 freq 'didn't - 1 freq titnt - 1 freq deid-end - 1 freq diidnt - 1 freq didnt - 3 freq didnt - 3 freq |
DIDNT |
| Time to execute Levenshtein function - 0.797867 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.992324 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.036566 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.082292 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.001189 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. |