Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Computational optimality theory
Computational optimality theory
An Introduction to the Theory of Computation
An Introduction to the Theory of Computation
Computational Complexity and Natural Language
Computational Complexity and Natural Language
One-level phonology: autosegmental representations and rules as finite automata
Computational Linguistics
A general computational model for word-form recognition and production
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Phonological derivation in optimality theory
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Some Notes on the Formal Properties of Bidirectional Optimality Theory
Journal of Logic, Language and Information
Recursion by optimization: on the complexity of bidirectional optimality theory
Natural Language Engineering
Directional constraint evaluation in Optimality Theory
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
OT syntax: decidability of generation-based optimization
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Comprehension and compilation in Optimality Theory
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Closure properties of linear context-free tree languages with an application to optimality theory
Theoretical Computer Science - Algebraic methods in language processing
Optimality Theory and Vector Semirings
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
The proper treatment of optimality in computational phonology: plenary talk
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Mix and match replacement rules
AdaptLRTtoND '09 Proceedings of the Workshop on Adaptation of Language Resources and Technology to New Domains
Some interdefinability results for syntactic constraint classes
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Formal parameters of phonology: from government phonology to SPE
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
A finite-state approximation of optimality theory: the case of finnish prosody
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Reference-Set constraints as linear tree transductions via controlled optimality systems
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
| Hi-index | 0.01 |
It has been argued that rule-based phonological descriptions can uniformaly be expressed as mappings carried out by finite-state transducers, and therefore fall within the class of rational relations. If this property of generative capacity is an empirically correct characterization of phonological mappings, it should hold of any sufficiently restrictive theory of phonology, whether it utilizes constraints or rewrite rules. In this paper, we investigate the conditions under which the phonological descriptions that are possible within the view of constraint interaction embodied in Optimality Theory (Prince and Smolensky 1993) remain within the class of rational relations. We show that this is true when GEN is itself a rational relation, and each of the constraints distinguishes among finitely many regular sets of candidates.