| ROA: | 455 |
| Title: | Infinity Limited: Constraining a Constraint-Based Theory |
| Authors: | Daniel Hall |
| Comment: | Generals paper, University of Toronto; defended February 2000. Presented at NAPhC 1, Concordia University, Montreal, April 2000. |
| Length: | 38 |
| Abstract: | This paper describes an algorithm for computing optimal outputs without generating an infinite set of candidate forms. It offers examples that show how the algorithm can produce the same output forms as standard Optimality Theory, and explores some of the ways in which eliminating the candidate set imposes useful restrictions on the theory (e.g., sympathy constraints and equally ranked constraints are disallowed). |
| Type: | Paper/tech report |
| Area/Keywords: | Computation,Formal Analysis,Phonology,Syntax,Learnability |
| Article: | Version 1
|
