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)
“I have the greatest aversion to being a candidate on a ticket with a man whose record as an upright public man is to be in question—to be defended from the beginning to the end.”
—Rutherford Birchard Hayes (1822–1893)
“Please do not take counsel of women who are so prejudiced that, as I once heard said, they would not allow a male grasshopper to chirp on their lawn; but out of your own great heart, refuse to set an example to such folly.”
—Frances E. Willard (1839–1898)