Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
doggitly (0) - 1 freq doititly (2) - 1 freq doggedly (2) - 1 freq doggies (3) - 1 freq gritly (3) - 1 freq doggie (3) - 3 freq moggit (3) - 1 freq doggy (3) - 5 freq droggit (3) - 2 freq coggly (3) - 1 freq doughty (3) - 3 freq raggity (3) - 2 freq dowily (3) - 4 freq boggit (3) - 1 freq dignity (3) - 29 freq loggit (3) - 2 freq loggarly (3) - 1 freq foggit (3) - 2 freq doggin (3) - 10 freq riggit (4) - 48 freq dormitory (4) - 5 freq dogger (4) - 1 freq dentily (4) - 1 freq doitit (4) - 13 freq diggin (4) - 43 freq |
doggitly (0) - 1 freq doggedly (3) - 1 freq doititly (4) - 1 freq foggit (5) - 2 freq dignity (5) - 29 freq doggin (5) - 10 freq loggarly (5) - 1 freq doggerel (5) - 2 freq deegital (5) - 4 freq diggle (5) - 1 freq boggit (5) - 1 freq digital (5) - 25 freq loggit (5) - 2 freq doggie (5) - 3 freq moggit (5) - 1 freq doggies (5) - 1 freq droggit (5) - 2 freq coggly (5) - 1 freq raggity (5) - 2 freq gritly (5) - 1 freq doughty (5) - 3 freq doggy (5) - 5 freq jiggit (6) - 1 freq dently (6) - 1 freq tiggit (6) - 2 freq |
SoundEx code - D234 distillery - 8 freq distilled - 5 freq dochtless - 1 freq 'distillit - 1 freq digital - 25 freq distils - 2 freq deegital - 4 freq distilleries - 5 freq douchtless - 2 freq douchtless-like - 2 freq digitalis - 1 freq distal - 2 freq dishtowel - 1 freq distillant - 1 freq doggedly - 1 freq doggitly - 1 freq distil - 1 freq dugdale - 7 freq dyshtooels - 1 freq dugstolemapiece - 1 freq |
MetaPhone code - TKTL ticket'll - 1 freq tactile - 1 freq doggedly - 1 freq doggitly - 1 freq dugdale - 7 freq |
DOGGITLY |
Time to execute Levenshtein function - 0.261167 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.520386 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.039822 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.052174 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.001070 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. |