| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| delyts (0) - 1 freq delyt (1) - 3 freq delytes (1) - 1 freq delyte (1) - 4 freq delete (2) - 9 freq delytin (2) - 1 freq dolts (2) - 2 freq delt (2) - 3 freq delite (2) - 4 freq delytit (2) - 3 freq delays (2) - 1 freq dellt (2) - 3 freq welts (2) - 1 freq deys (2) - 9 freq melts (2) - 10 freq neyts (2) - 5 freq dells (2) - 1 freq delta (2) - 1 freq denys (2) - 1 freq delfs (2) - 1 freq delft (2) - 2 freq celts (2) - 9 freq eelits (2) - 1 freq depts (2) - 3 freq derts (2) - 2 freq |
delyts (0) - 1 freq delytes (1) - 1 freq dolts (2) - 2 freq delyt (2) - 3 freq delyte (2) - 4 freq depts (3) - 3 freq eelits (3) - 1 freq celts (3) - 9 freq delta (3) - 1 freq derts (3) - 2 freq pelts (3) - 4 freq adults (3) - 49 freq dells (3) - 1 freq belts (3) - 15 freq debts (3) - 8 freq delfs (3) - 1 freq delytit (3) - 3 freq delays (3) - 1 freq delite (3) - 4 freq delytin (3) - 1 freq delete (3) - 9 freq idults (3) - 1 freq delt (3) - 3 freq melts (3) - 10 freq welts (3) - 1 freq |
SoundEx code - D432 delyts - 1 freq delytesum - 2 freq dialled's - 1 freq delytes - 1 freq dolts - 2 freq dollydigital - 13 freq deltcharlie - 1 freq dialadeck - 1 freq |
MetaPhone code - TLTS toilets - 32 freq telt's - 4 freq tilts - 9 freq delyts - 1 freq dialled's - 1 freq delytes - 1 freq dolts - 2 freq |
DELYTS |
| Time to execute Levenshtein function - 0.177117 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.492716 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.027601 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.073958 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.000905 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. |