| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| debatit (0) - 9 freq debatin (1) - 3 freq debait (1) - 1 freq debates (2) - 11 freq deviatit (2) - 2 freq defait (2) - 7 freq elatit (2) - 1 freq delitit (2) - 3 freq defeatit (2) - 5 freq debatin' (2) - 1 freq datit (2) - 6 freq heatit (2) - 2 freq delytit (2) - 3 freq denotit (2) - 1 freq deavit (2) - 1 freq deletit (2) - 3 freq dentit (2) - 3 freq debate (2) - 81 freq debater (2) - 1 freq defaitit (2) - 1 freq rebattit (2) - 2 freq departit (2) - 5 freq negatit (2) - 1 freq debating (2) - 4 freq relatit (2) - 34 freq |
debatit (0) - 9 freq debait (2) - 1 freq debatin (2) - 3 freq defaitit (3) - 1 freq debater (3) - 1 freq dentit (3) - 3 freq debate (3) - 81 freq debit (3) - 2 freq debated (3) - 3 freq devotit (3) - 5 freq beatit (3) - 1 freq denotit (3) - 1 freq demotit (3) - 1 freq deletit (3) - 3 freq delitit (3) - 3 freq deviatit (3) - 2 freq debates (3) - 11 freq datit (3) - 6 freq defeatit (3) - 5 freq delytit (3) - 3 freq dystit (4) - 1 freq dartit (4) - 2 freq debut (4) - 7 freq duntit (4) - 25 freq dabaittie (4) - 2 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 - TBTT doubted - 7 freq debated - 3 freq debatit - 9 freq doobted - 1 freq |
DEBATIT |
| Time to execute Levenshtein function - 0.182409 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.344368 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.028010 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.036715 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.000862 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. |