<OT> New Posting: ROA-897

[Rutgers Optimality Archive]

ROA 897-0107

How to Define Simulated Annealing for Optimality Theory?

Tamás Bíró <birot at nytud.hu>

Direct link: http://roa.rutgers.edu/view.php3?roa=897


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 representati
ons of a violation profile are proposed: using polynomials
and ordinal numbers.

Comments: 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).
Keywords: heuristic combinatorial optimization; simulated annealing;
ordinal numbers; polynomials
Areas: Computation,Formal Analysis
Type: Conference Proceedings Chapter

Direct link: http://roa.rutgers.edu/view.php3?roa=897