How to Define Simulated Annealing for Optimality Theory ?

Optimality Theory (OT) requires an algorithm optimising the Harmony function on the set of candidates. Simulated annealing, a well-known heuristic technique for combinatorial optimisation, has been argued to be an empirically adequate solution to this problem. In order to generalise simulated annealing for a non-real valued Harmony function, two representations of a violation profile are proposed: by using polynomials and ordinal numbers.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  Patrick Suppes,et al.  Axiomatic set theory , 1969 .

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[5]  Paul Smolensky,et al.  Information processing in dynamical systems: foundations of harmony theory , 1986 .

[6]  Gerard Kempen,et al.  Incremental syntactic tree formation in human sentence processing: A cognitive architecture based on activation decay and simulated annealing , 1989 .

[7]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[8]  T. Mark Ellison,et al.  Phonological Derivation in Optimality Theory , 1994, COLING.

[9]  S.W.K. Chan Semantic parsing as an energy minimization problem , 1997, 1997 IEEE International Conference on Intelligent Processing Systems (Cat. No.97TH8335).

[10]  P. Smolensky,et al.  Learnability in Optimality Theory , 2000, Linguistic Inquiry.

[11]  Giorgio Satta,et al.  Optimality Theory and the Generative Complexity of Constraint Violability , 1998, CL.

[12]  Jonas Kuhn Processing Optimality-theoretic Syntax by Interleaved Chart Parsing and Generation , 2000, ACL.

[13]  Gertjan van Noord,et al.  Approximation and Exactness in Finite State Optimality Theory , 2000, ACL 2000.

[14]  Jason Eisner Easy and Hard Constraint Ranking in Optimality Theory: Algorithms and Complexity , 2000 .

[15]  Tamás Biró,et al.  Quadratic Alignment Constraints and Finite State Optimality Theory , 2003 .

[16]  Gerhard Jäger,et al.  Maximum Entropy Models and Stochastic Optimality Theory , 2003 .

[17]  Tamás Bíró,et al.  When the Hothead Speaks. Simulated Annealing Optimality Theory for Dutch Fast Speech , 2005, CLIN.

[18]  P. Smolensky,et al.  Optimality Theory: Constraint Interaction in Generative Grammar , 2004 .

[19]  Tamás Biró,et al.  Finding the right words: implementing optimality theory with simulated annealing , 2006 .