| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| digits (0) - 3 freq dights (1) - 5 freq divits (1) - 1 freq limits (2) - 15 freq dignit (2) - 1 freq lights (2) - 99 freq dichts (2) - 7 freq nights (2) - 62 freq digital (2) - 25 freq fights (2) - 3 freq bigots (2) - 4 freq eijits (2) - 1 freq ditit (2) - 1 freq dight (2) - 3 freq dirts (2) - 1 freq dighty (2) - 2 freq dingies (2) - 1 freq digs (2) - 19 freq vigils (2) - 1 freq visits (2) - 24 freq dingit (2) - 13 freq dignity (2) - 29 freq rights (2) - 32 freq dints (2) - 2 freq tights (2) - 15 freq |
digits (0) - 3 freq divits (2) - 1 freq digitise (2) - 2 freq dights (2) - 5 freq dirts (3) - 1 freq diets (3) - 4 freq divots (3) - 5 freq bigots (3) - 4 freq digs (3) - 19 freq dints (3) - 2 freq dists (3) - 1 freq digital (3) - 25 freq gits (3) - 102 freq dittys (4) - 1 freq dats (4) - 21 freq darts (4) - 31 freq depts (4) - 3 freq edgit (4) - 1 freq digitalis (4) - 1 freq dorts (4) - 8 freq dairts (4) - 2 freq dolts (4) - 2 freq dogems (4) - 1 freq dogmas (4) - 1 freq dugs (4) - 228 freq |
SoundEx code - D232 decades - 47 freq decides - 27 freq dights - 5 freq dichts - 7 freq ducts - 4 freq digits - 3 freq dissatisfaction - 2 freq discotheque - 2 freq dusts - 2 freq deictic - 1 freq digitise - 2 freq digitised - 1 freq dists - 1 freq day-set's - 1 freq digitisin - 1 freq dost's - 1 freq dissatisfied - 1 freq deciduous - 1 freq doocots - 2 freq duguids' - 1 freq duguid's - 5 freq desydes - 1 freq decaedes - 1 freq distaste - 1 freq dekaeds - 1 freq dustspecks - 1 freq dtktwqiivy - 1 freq dztticlfeo - 1 freq deekthejoiner - 8 freq dextcn - 1 freq dcwatch - 1 freq dixdq - 3 freq dzodesvjgv - 4 freq dsdeakkmk - 1 freq deazudxlz - 1 freq dwjjtwjmyc - 1 freq dcsdcouncil - 3 freq digitscotland - 1 freq dstgidv - 1 freq |
MetaPhone code - TJTS digits - 3 freq toijets - 1 freq digitise - 2 freq |
DIGITS |
| Time to execute Levenshtein function - 0.208692 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.351102 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.027323 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.036977 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.000886 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. |