| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dictionar (0) - 95 freq dictionary (1) - 116 freq dictionars (1) - 46 freq dictionary' (2) - 5 freq diction (2) - 9 freq 'dictionar' (2) - 1 freq dictionairs (2) - 1 freq 'dictionary (2) - 2 freq fictional (2) - 3 freq edicational (3) - 2 freq 'dictionary' (3) - 1 freq dictioun (3) - 1 freq feictional (3) - 1 freq fiction (3) - 29 freq dictionaries (3) - 40 freq directional (3) - 1 freq stationary (4) - 1 freq locational (4) - 1 freq dictation (4) - 1 freq cautionary (4) - 2 freq optional (4) - 4 freq paction (4) - 18 freq unction (4) - 1 freq notional (4) - 1 freq ections (4) - 13 freq |
dictionar (0) - 95 freq dictionary (1) - 116 freq dictionars (2) - 46 freq dictionairs (3) - 1 freq 'dictionary (3) - 2 freq diction (3) - 9 freq dictionary' (3) - 5 freq dictionaries (4) - 40 freq dictioun (4) - 1 freq edicational (4) - 2 freq 'dictionar' (4) - 1 freq fictional (4) - 3 freq cautioner (5) - 1 freq reactionary (5) - 6 freq edication (5) - 3 freq unctioneer (5) - 2 freq doctor (5) - 243 freq auctioneer (5) - 2 freq educational (5) - 55 freq dictator (5) - 3 freq doctour (5) - 13 freq fiction (5) - 29 freq feictional (5) - 1 freq 'dictionary' (5) - 1 freq cautionary (5) - 2 freq |
SoundEx code - D235 distance - 168 freq distinguishing - 1 freq distance-bit - 1 freq distant - 53 freq decidin - 17 freq distinct - 33 freq destination - 17 freq dichtin - 40 freq dochtna - 2 freq distinguish - 6 freq destiny - 12 freq distance-but - 3 freq distancepit - 1 freq daikitin - 1 freq dustin - 12 freq distinckt - 1 freq distinguished - 3 freq diction - 9 freq distantly - 2 freq dictionary - 116 freq disdain - 10 freq distempered - 3 freq disdainit - 1 freq disdainin - 1 freq dictionars - 46 freq distense - 1 freq dichtin' - 1 freq distain - 1 freq distanced - 4 freq destinies - 1 freq destined - 12 freq distinctive - 16 freq distinctly - 4 freq destinie - 3 freq dissydents - 4 freq dissydent - 1 freq decidein - 1 freq distinctively - 1 freq distincitve - 1 freq distinction - 26 freq destinations - 3 freq distanee - 2 freq dictionaries - 40 freq dictioun - 1 freq dictionar - 95 freq disdainfully - 1 freq decadence - 2 freq distinguisht - 1 freq distances - 10 freq dictionary' - 5 freq 'dictionary - 2 freq 'dictionar' - 1 freq destinautioun - 4 freq dightan - 1 freq diastimeter - 1 freq duggidniss - 1 freq distancin - 10 freq dyghtin - 1 freq disteinction - 2 freq distante - 2 freq distinctless - 1 freq distinguishes - 2 freq distinguishin - 3 freq distinctions - 2 freq dictionairs - 1 freq dictionaries' - 1 freq dictum - 1 freq 'dictionary' - 1 freq disteinguishes - 1 freq distinction's - 1 freq desydin - 1 freq douchtna - 1 freq disteenction - 3 freq disteinctive - 2 freq disteenctive - 1 freq dictionar-dredgin - 1 freq dusting - 1 freq dictionar-traalin - 1 freq deciding - 4 freq dustin's - 1 freq distemper - 1 freq dichotomy - 1 freq distends - 1 freq dichotomies - 1 freq dixie-deenies - 1 freq €˜destiny - 1 freq €œdestination - 1 freq deistin - 3 freq disteenctions - 1 freq dissidents - 2 freq distinctiveness - 1 freq distinkshins - 1 freq dcdndbfj - 1 freq distant' - 1 freq degwdm - 1 freq distince - 1 freq dichting - 1 freq distancing - 14 freq dougiedonnelly - 1 freq distingwished - 1 freq dgstandard - 2 freq dustmopp - 1 freq disstunt - 1 freq |
MetaPhone code - TKXNR dictionary - 116 freq dictionar - 95 freq dictionary' - 5 freq 'dictionary - 2 freq 'dictionar' - 1 freq 'dictionary' - 1 freq |
DICTIONAR |
| Time to execute Levenshtein function - 0.174997 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.339032 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.027264 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.036563 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.000837 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. |