UnscrambleTheWord.cocomplete
Is it a Scrabble word? See definition, points, and words you can make.
Is complete a Scrabble word?
Word Games
- Scrabble US/Canada (OTCWL) Yes
- Scrabble UK (SOWPODS) Yes
- Wordle No
- Words With Friends Yes
Scrabble US/Canada (OTCWL) 
Wordle 
Words With Friends What is the meaning of complete?
Definition
verb (English)
1. (ambitransitive) To finish; to make done; to reach the end.Examples: "He completed the assignment on time."; "How far are you willing to reach? While you're coveting outcomes that you can't achieve Now you're on a mission, but you won't complete Shouldn't hold on to me, hold on to me Try to let go of me, let go of me"Synonyms: accomplish, finish, complete, conclude, consummate, discontinue, do, endambitransitive
2. (transitive) To make whole or entire.Examples: "The last chapter completes the book nicely."Synonyms: consummate, perfect, top offtransitive
3. (poker) To call from the small blind in an unraised pot.
adj (English)
1. (mathematical analysis, of a metric space or topological group) In which every Cauchy sequence converges to a point within the space.
2. (ring theory, of a local ring) Complete as a topological group with respect to its m-adic topology, where m is its unique maximal idea.
3. (algebra, of a lattice) In which every set with a lower bound has a greatest lower bound.
4. (mathematics, of a category) In which all small limits exist.
5. (logic, of a proof system of a formal system with respect to a given semantics) In which every semantically valid well-formed formula is provable.Examples: "Gödel's first incompleteness theorem showed that Principia could not be both consistent and complete. According to the theorem, for every sufficiently powerful logical system (such as Principia), there exists a statement G that essentially reads, "The statement G cannot be proved." Such a statement is a sort of Catch-22: if G is provable, then it is false, and the system is therefore inconsistent; and if G is not provable, then it is true, and the system is therefore incomplete.ᵂᴾ"
6. (computing theory, of a problem) That is in a given complexity class and is such that every other problem in the class can be reduced to it (usually in polynomial time or logarithmic space).Examples: "QMA arises naturally in the study of quantum computation, and it also has a complete problem, Local Hamiltonian, which is a generalization of k-SAT."; "BPP behaves differently in some ways from other classes we have seen. For example, we know of no complete languages for BPP."
Definition source: Wiktionary