| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| defaitit (0) - 1 freq debatit (2) - 9 freq deficit (2) - 10 freq depairtit (2) - 14 freq definit (2) - 3 freq delitit (2) - 3 freq defeatit (2) - 5 freq departit (2) - 5 freq repaitit (2) - 5 freq defait (2) - 7 freq lifitit (3) - 2 freq daivit (3) - 4 freq traitit (3) - 5 freq feartit (3) - 1 freq depletit (3) - 1 freq denotit (3) - 1 freq defendit (3) - 2 freq dairtit (3) - 1 freq relatit (3) - 34 freq refractit (3) - 1 freq demandit (3) - 45 freq awaitit (3) - 3 freq debaiten (3) - 1 freq decairt (3) - 1 freq drainit (3) - 4 freq |
defaitit (0) - 1 freq defeatit (2) - 5 freq defait (3) - 7 freq definit (3) - 3 freq delitit (3) - 3 freq debatit (3) - 9 freq deficit (3) - 10 freq default (4) - 10 freq ditit (4) - 1 freq daetit (4) - 1 freq definet (4) - 1 freq fautit (4) - 3 freq definite (4) - 20 freq heftit (4) - 5 freq deletit (4) - 3 freq doitit (4) - 13 freq editit (4) - 6 freq datit (4) - 6 freq devotit (4) - 5 freq draftit (4) - 4 freq defaut (4) - 20 freq defiant (4) - 12 freq dentit (4) - 3 freq deviatit (4) - 2 freq demotit (4) - 1 freq |
SoundEx code - D133 divided - 12 freq dividit - 7 freq defeated - 7 freq doubted - 7 freq defeatit - 5 freq debated - 3 freq devoted - 4 freq dabbity-dab - 4 freq debatit - 9 freq divyded - 1 freq deptht - 4 freq dievydit - 1 freq devotit - 5 freq 'dividit - 1 freq devotedly - 1 freq doobted - 1 freq deviatit - 2 freq defaitit - 1 freq davidhdickson - 1 freq davidhtorrance - 1 freq |
MetaPhone code - TFTT divided - 12 freq dividit - 7 freq defeated - 7 freq defeatit - 5 freq devoted - 4 freq divyded - 1 freq tufted - 1 freq dievydit - 1 freq devotit - 5 freq 'dividit - 1 freq deviatit - 2 freq defaitit - 1 freq dightit - 1 freq |
DEFAITIT |
| Time to execute Levenshtein function - 0.362065 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.634614 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.057870 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.040067 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.000903 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. |