Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
digitise (0) - 2 freq digitised (1) - 1 freq digitisin (2) - 1 freq digits (2) - 3 freq dignitie (2) - 2 freq digital (3) - 25 freq fugitive (3) - 3 freq dug-wise (3) - 1 freq sanitise (3) - 1 freq dirtie (3) - 1 freq disaise (3) - 2 freq disguise (3) - 14 freq dights (3) - 5 freq divits (3) - 1 freq distie (3) - 1 freq minimise (3) - 1 freq nightie (3) - 1 freq big-time (3) - 1 freq jig-time (3) - 1 freq bigtime (3) - 1 freq jigtime (3) - 1 freq uinitie (3) - 1 freq dintist (3) - 3 freq wiggitie (3) - 1 freq diminish (3) - 3 freq |
digitise (0) - 2 freq digitised (2) - 1 freq digits (2) - 3 freq digitisin (3) - 1 freq divits (4) - 1 freq digitalis (4) - 1 freq dights (4) - 5 freq dignitie (4) - 2 freq digital (4) - 25 freq deities (5) - 2 freq diagnose (5) - 1 freq dists (5) - 1 freq gites (5) - 1 freq digestive (5) - 4 freq ditties (5) - 1 freq dightit (5) - 1 freq dafities (5) - 1 freq bigots (5) - 4 freq edgewise (5) - 1 freq dirts (5) - 1 freq doutis (5) - 1 freq dints (5) - 2 freq divots (5) - 5 freq dughoose (5) - 1 freq diets (5) - 5 freq |
SoundEx code - D232 decades - 49 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 |
DIGITISE |
Time to execute Levenshtein function - 0.175184 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.382458 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.027757 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.037631 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.001082 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. |