| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dingies (0) - 1 freq gingies (1) - 1 freq dinkies (1) - 1 freq dingied (1) - 3 freq wingies (1) - 1 freq dinghies (1) - 1 freq dingle (2) - 7 freq hinnies (2) - 6 freq pinkies (2) - 3 freq hingie (2) - 1 freq dingey (2) - 1 freq windies (2) - 2 freq dregies (2) - 1 freq dinnaes (2) - 1 freq diaries (2) - 5 freq denties (2) - 2 freq mingles (2) - 1 freq dunkies (2) - 1 freq kingie (2) - 1 freq kingis (2) - 2 freq ingins (2) - 15 freq doggies (2) - 1 freq dinger (2) - 17 freq midgies (2) - 20 freq siggies (2) - 1 freq |
dingies (0) - 1 freq dings (2) - 16 freq dinghies (2) - 1 freq wingies (2) - 1 freq gingies (2) - 1 freq dinkies (2) - 1 freq dingied (2) - 3 freq dangles (3) - 1 freq dirges (3) - 1 freq dinged (3) - 18 freq dingyed (3) - 1 freq dainties (3) - 5 freq danglies (3) - 2 freq dougies (3) - 2 freq dingit (3) - 13 freq binges (3) - 1 freq dingiein (3) - 2 freq dandies (3) - 15 freq dingers (3) - 3 freq singis (3) - 1 freq hinges (3) - 19 freq dinnis (3) - 1 freq denies (3) - 12 freq deinties (3) - 2 freq dingin (3) - 59 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 - TNJS dingies - 1 freq tounge's - 1 freq |
DINGIES |
| Time to execute Levenshtein function - 0.352436 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.526184 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.027342 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.071307 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.000949 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. |