Hostname: page-component-cb9f654ff-c75p9 Total loading time: 0 Render date: 2025-08-22T11:52:03.241Z Has data issue: false hasContentIssue false
  • English
  • Français

Recursion by optimization: on the complexity of bidirectional optimality theory

Published online by Cambridge University Press:  04 June 2003

GERHARD JÄGER
GERHARD JÄGER
Affiliation:
Institute for Linguistics, University of Potsdam, PF 6015 53, D-14415 Potsdam, Germany e-mail: jaeger@ling.uni-potsdam.de
Get access Rights & Permissions [Opens in a new window]

Abstract

The paper investigates the computational complexity of different versions of Optimality Theory (OT). The result of Frank and Satta (1998) is used as a starting point. These authors show that unidirectional optimization can be implemented by finite state techniques if only binary constraints are used. The consequences of (a) taking gradient constraints into account and (b) using bidirectional optimization in the sense of Blutner (2000) are explored. The central result of the paper is that the combination of gradient constraints and bidirectionality leads to a massive increase of computational complexity.

Information

Type
Research Article
Information
Natural Language Engineering , Volume 9 , Issue 1 , March 2003 , pp. 21 - 38
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable