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)
“Hear, then, a mortal Muse thy praise rehearse,
In no ignoble verse;
But such as thy own voice did practise here,
When thy first-fruits of Poesy were given,
To make thyself a welcome inmate there;
While yet a young probationer,
And candidate of Heaven.”
—John Dryden (1631–1700)
“Such a set of tittle tattle, prittle prattle visitants! Oh Dear! I am so sick of the ceremony and fuss of these fall lall people! So much dressing—chitchat—complimentary nonsense—In short, a country town is my detestation. All the conversation is scandal, all the attention, dress, and almost all the heart, folly, envy, and censoriousness.”
—Frances Burney (1752–1840)