| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deletit (0) - 3 freq delytit (1) - 3 freq delitit (1) - 3 freq depletit (1) - 1 freq repetit (2) - 1 freq dentit (2) - 3 freq beltit (2) - 14 freq delytin (2) - 1 freq devotit (2) - 5 freq desertit (2) - 7 freq delete (2) - 9 freq debatit (2) - 9 freq deeit (2) - 1 freq deleted (2) - 4 freq deletion (2) - 1 freq detectit (2) - 5 freq electit (2) - 22 freq deceit (2) - 5 freq denotit (2) - 1 freq daetit (2) - 1 freq belevit (2) - 1 freq depleetit (2) - 1 freq deludit (2) - 1 freq deemit (2) - 2 freq selectit (2) - 7 freq |
deletit (0) - 3 freq delitit (1) - 3 freq delytit (1) - 3 freq depletit (2) - 1 freq deleirit (3) - 1 freq deludit (3) - 1 freq leetit (3) - 6 freq daetit (3) - 1 freq relatit (3) - 34 freq depleetit (3) - 1 freq meltit (3) - 26 freq delvit (3) - 1 freq elatit (3) - 1 freq defeatit (3) - 5 freq denotit (3) - 1 freq deleerit (3) - 8 freq demotit (3) - 1 freq peltit (3) - 5 freq delete (3) - 9 freq debatit (3) - 9 freq delytin (3) - 1 freq beltit (3) - 14 freq dentit (3) - 3 freq deleted (3) - 4 freq devotit (3) - 5 freq |
SoundEx code - D433 delytit - 3 freq delitit - 3 freq deleted - 4 freq dilated - 1 freq diluted - 5 freq delytit-like - 1 freq deluded - 1 freq deletit - 3 freq €˜diluted - 1 freq deludedly - 1 freq deludit - 1 freq dollydaydream - 6 freq |
MetaPhone code - TLTT tiltit - 7 freq delytit - 3 freq delitit - 3 freq tilted - 5 freq deleted - 4 freq dilated - 1 freq diluted - 5 freq tiltet - 1 freq deluded - 1 freq tltit - 1 freq deletit - 3 freq €˜diluted - 1 freq deludit - 1 freq |
DELETIT |
| Time to execute Levenshtein function - 0.218906 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.397230 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.027718 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.038193 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.000945 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. |