[Author Login]
Title:How to Define Simulated Annealing for Optimality Theory?
Authors:Tamas Biro
Comment:Appeared in the pre-conference proceedings, and to appear in the post-conference electronic proceedings of FG-MoL 2005 (Edinburgh). A more elaborate version can be found in my dissertation ('Finding the Right Words', Chapter 3).
Abstract: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 to a non-real valued Harmony function, two representations of a violation profile are proposed: using polynomials and ordinal numbers.
Type:Paper/tech report
Area/Keywords:Computation,Formal Analysis
Article:Version 1