| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dooncast (0) - 5 freq douncast (1) - 2 freq doonwart (2) - 3 freq ootcast (2) - 2 freq oonces (3) - 3 freq doo-cot (3) - 1 freq podcast (3) - 26 freq dounwart (3) - 1 freq doocoot (3) - 1 freq opencast (3) - 1 freq donnart (3) - 3 freq doonfaa (3) - 3 freq ootcasts (3) - 1 freq doonhame (3) - 2 freq concait (3) - 6 freq doonlaid (3) - 2 freq doonways (3) - 1 freq doocot (3) - 28 freq soonest (3) - 1 freq roondest (3) - 2 freq dooncome (3) - 1 freq uncast (3) - 1 freq doonward (3) - 5 freq dooners (3) - 2 freq bookcase (3) - 2 freq |
dooncast (0) - 5 freq douncast (1) - 2 freq uncast (4) - 1 freq oncost (4) - 1 freq opencast (4) - 1 freq doonsit (4) - 1 freq doncaster (4) - 4 freq ootcast (4) - 2 freq doonwart (4) - 3 freq doonbeat (5) - 1 freq forecast (5) - 26 freq doonpish (5) - 2 freq dauncit (5) - 2 freq dances (5) - 43 freq boonces (5) - 4 freq dentist (5) - 46 freq incest (5) - 3 freq dunces (5) - 5 freq duncht (5) - 1 freq dancis (5) - 2 freq dynasty (5) - 10 freq oonjust (5) - 1 freq dounwart (5) - 1 freq doons (5) - 10 freq outcast (5) - 2 freq |
SoundEx code - D522 dances - 43 freq dunkey's - 6 freq dunkies - 1 freq doncaster - 4 freq douncast - 2 freq donkeys - 9 freq dunces - 5 freq dooncast - 5 freq damascus - 6 freq demagogues - 2 freq dingies - 1 freq doonsize - 1 freq danssis - 1 freq dance's - 2 freq dionysius - 1 freq dinkies - 1 freq dunssis - 1 freq dunches - 1 freq dinghies - 1 freq damages - 1 freq dionysus - 2 freq denishakilloh - 3 freq doncasters - 1 freq dannycaz - 2 freq domjack - 1 freq dances - 1 freq dunnachuckbruck - 2 freq dmjack - 1 freq dansis - 3 freq dancis - 2 freq |
MetaPhone code - TNKST douncast - 2 freq dooncast - 5 freq tnext - 1 freq |
DOONCAST |
| Time to execute Levenshtein function - 0.204277 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.377516 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.027580 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.036967 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.000890 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. |