Input and GEN: The Candidate Set
Optimality theory supposes that there are no language-specific restrictions on the input. This is called richness of the base. Every grammar can handle every possible input. For example, a language without complex clusters must be able to deal with an input such as /flask/. Languages without complex clusters differ on how they will resolve this problem; some will epenthesize (e.g., or if all codas are banned) and some will delete (e.g., ). Given any input, GEN generates an infinite number of candidates, or possible realizations of that input. A language's grammar (its ranking of constraints) determines which of the infinite candidates will be assessed as optimal by EVAL.
Read more about this topic: Optimality Theory
Famous quotes containing the words input, candidate and/or set:
“Family life is not a computer program that runs on its own; it needs continual input from everyone.”
—Neil Kurshan (20th century)
“If we should swap a good library for a second-rate stump speech and not ask for boot, it would be thoroughly in tune with our hearts. For deep within each of us lies politics. It is our football, baseball, and tennis rolled into one. We enjoy it; we will hitch up and drive for miles in order to hear and applaud the vitriolic phrases of a candidate we have already reckoned we’ll vote against.”
—Federal Writers’ Project Of The Wor, U.S. public relief program (1935-1943)
“The love of truth, virtue, and the happiness of mankind are specious pretexts, but not the inward principles that set divines at work; else why should they affect to abuse human reason, to disparage natural religion, to traduce the philosophers as they universally do?”
—George Berkeley (1685–1753)