Some thoughts on classic optimality theory(Prince & Smolensky 1993/2004)
[This is a term paper of mine, I'm not that familar with OT, thus I cannot guarantee someone has not made similar proposals before , comments are welcome .] Basic structure of classic optimality theory Generation Function : G(input) = {C1, C2,..., Cn} Evaluation Function : E({C1, C2, C3,..., Cn}, Con) = Ck (1<=k<=n); Ck = <In_k , G(in_k)>, In_k is the kth input, 1<=k<=n To be more precise, G-function could be considered as a function of the form P(g(x), x), in which x is input, g is a generation function that generates an infinite number of outputs, and P is a pairing function which generates an order pair called candidate, in which an input is paired with its corresponding output. The G-function thus generates an infinite number of candidates, which are inputs to the E-function, ...
