| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| douncast (0) - 2 freq dooncast (1) - 5 freq outcast (2) - 2 freq dounwart (2) - 1 freq uncast (2) - 1 freq duncans (3) - 1 freq doungaun (3) - 2 freq douna (3) - 1 freq dourest (3) - 3 freq oncost (3) - 1 freq dounhaud (3) - 1 freq douglass (3) - 4 freq duncht (3) - 1 freq roughcast (3) - 2 freq opencast (3) - 1 freq doun-pit (3) - 1 freq ounces (3) - 1 freq douns (3) - 2 freq dunces (3) - 5 freq douncome (3) - 2 freq doungang (3) - 1 freq dounladit (3) - 2 freq dounfaw (3) - 5 freq dounlade (3) - 3 freq dounward (3) - 1 freq |
douncast (0) - 2 freq dooncast (1) - 5 freq uncast (3) - 1 freq oncost (4) - 1 freq dauncit (4) - 2 freq duncht (4) - 1 freq opencast (4) - 1 freq dunces (4) - 5 freq doncaster (4) - 4 freq dounwart (4) - 1 freq outcast (4) - 2 freq ootcast (5) - 2 freq donnart (5) - 3 freq dances (5) - 43 freq concait (5) - 6 freq bounces (5) - 4 freq haunfast (5) - 2 freq dunch't (5) - 1 freq doungate (5) - 1 freq dentist (5) - 46 freq dancis (5) - 2 freq doonsit (5) - 1 freq dintist (5) - 3 freq dunecht (5) - 1 freq pounces (5) - 1 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 |
DOUNCAST |
| Time to execute Levenshtein function - 0.493818 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.900566 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.033460 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.101074 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.001416 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. |