| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| damascus (0) - 6 freq discus (3) - 1 freq macus (3) - 1 freq damascene (3) - 1 freq marcus (3) - 2 freq abacus (3) - 2 freq damages (3) - 1 freq damask (3) - 2 freq discos (4) - 6 freq madass (4) - 2 freq tammas's (4) - 3 freq ramarks (4) - 1 freq doacs (4) - 1 freq meniscus (4) - 1 freq damies (4) - 1 freq markus (4) - 1 freq dumsch (4) - 1 freq samosas (4) - 1 freq yaaassss (4) - 3 freq jamaica (4) - 24 freq lazarus (4) - 20 freq domains (4) - 6 freq maus (4) - 1 freq danadays (4) - 10 freq damagin (4) - 3 freq |
damascus (0) - 6 freq damascene (4) - 1 freq discus (4) - 1 freq demsels (5) - 32 freq dumsch (5) - 1 freq discs (5) - 3 freq demoss (5) - 1 freq miscas (5) - 1 freq dimsels (5) - 1 freq marcus (5) - 2 freq discos (5) - 6 freq macus (5) - 1 freq damages (5) - 1 freq damask (5) - 2 freq daisy's (6) - 9 freq danssis (6) - 1 freq dashes (6) - 1 freq dancis (6) - 2 freq deavances (6) - 1 freq fuscus (6) - 2 freq demaunds (6) - 1 freq smashes (6) - 1 freq masts (6) - 8 freq damson (6) - 1 freq daunss (6) - 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 - TMSKS damascus - 6 freq |
DAMASCUS |
| Time to execute Levenshtein function - 0.348976 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.521352 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.064549 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.038164 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.000964 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. |