Some Notes on the Formal Properties of Bidirectional Optimality Theory

Authors:
Gerhard Jäger
Affiliations:
Utrecht Institute of Linguistics (OTS), Trans 10, 3512 JK Utrecht, The Netherlands. E-mail: Gerhard.Jaeger@let.uu.nl
Venue:
Journal of Logic, Language and Information
Year:
2002

Citing 4
Cited 5

Tree languages

Handbook of formal languages, vol. 3
Finite-State Language Processing

Finite-State Language Processing
Optimality theory and the generative complexity of constraint violability

Computational Linguistics
Representing constraints with automata

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics

Recursion by optimization: on the complexity of bidirectional optimality theory

Natural Language Engineering
Automatic Alphabet Recognition

Information Retrieval
Closure properties of linear context-free tree languages with an application to optimality theory

Theoretical Computer Science - Algebraic methods in language processing
On the Asymmetrical Difficulty of Acquiring Person Reference in French: Production Versus Comprehension

Journal of Logic, Language and Information
Bidirectional Optimization from Reasoning and Learning in Games

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss some formal properties of the model ofbidirectional Optimality Theory that was developed inBlutner (2000). We investigate the conditions under whichbidirectional optimization is a well-defined notion, and we give aconceptually simpler reformulation of Blutner's definition. In thesecond part of the paper, we show that bidirectional optimization can bemodeled by means of finite state techniques. There we rely heavily onthe related work of Frank and Satta (1998) about unidirectionaloptimization.