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)
“The Republicans have a “me too” candidate running on a “yes but” platform, advised by a “has been” staff.”
—Adlai Stevenson (1900–1965)
“Mothers are not the nameless, faceless stereotypes who appear once a year on a greeting card with their virtues set to prose, but women who have been dealt a hand for life and play each card one at a time the best way they know how. No mother is all good or all bad, all laughing or all serious, all loving or all angry. Ambivalence rushes through their veins.”
—Erma Bombeck (20th century)