11-Letter Words Containing: A,B,C,D,E,I,N
(In Any Order)Best Scoring 11 Letter Words With: A,B,C,D,E,I,N
Expand? | Word | Save? | Length | Usage | Points | Type | ||
---|---|---|---|---|---|---|---|---|
decarbonize | 11 | 25 | verbv | |||||
verb • remove carbon from (an engine) | ||||||||
backslidden | 11 | 21 | verb, adjectivev, adj | |||||
verb • drop to a lower level, as in one's morals or standards | ||||||||
forbiddance | 11 | 20 | nounn | |||||
noun • an official prohibition or edict against something • the action of prohibiting or inhibiting or forbidding (or an instance thereof) | ||||||||
disbranched | 11 | 20 | verbv | |||||
Valid word for Scrabble US
| ||||||||
becowarding | 11 | 20 | adjectiveadj | |||||
Valid word for Scrabble US
| ||||||||
disbranches | 11 | 19 | verbv | |||||
Valid word for Scrabble US
| ||||||||
medicinable | 11 | 18 | adjectiveadj | |||||
Valid word for Scrabble US
| ||||||||
misbalanced | 11 | 18 | adjectiveadj | |||||
Valid word for Scrabble US
| ||||||||
undecidable | 11 | 17 | adjectiveadj | |||||
adjective • Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included. • (of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.) | ||||||||
cornbraided | 11 | 17 | adjectiveadj | |||||
Valid word for Scrabble US
| ||||||||
or scroll down to see all results... | ||||||||
Tip: Scrabble EU allows far more words than US! Also change the max length to see more words. |