Computer Science – Computation and Language
Scientific paper
2001-02-22
Jason Eisner, Lauri Karttunen and Alain Theriault (eds.), Finite-State Phonology: Proceedings of the 5th Workshop of the ACL S
Computer Science
Computation and Language
11 pages, 5 figures, workshop
Scientific paper
Primitive Optimality Theory (OTP) (Eisner, 1997a; Albro, 1998), a computational model of Optimality Theory (Prince and Smolensky, 1993), employs a finite state machine to represent the set of active candidates at each stage of an Optimality Theoretic derivation, as well as weighted finite state machines to represent the constraints themselves. For some purposes, however, it would be convenient if the set of candidates were limited by some set of criteria capable of being described only in a higher-level grammar formalism, such as a Context Free Grammar, a Context Sensitive Grammar, or a Multiple Context Free Grammar (Seki et al., 1991). Examples include reduplication and phrasal stress models. Here we introduce a mechanism for OTP-like Optimality Theory in which the constraints remain weighted finite state machines, but sets of candidates are represented by higher-level grammars. In particular, we use multiple context-free grammars to model reduplication in the manner of Correspondence Theory (McCarthy and Prince, 1995), and develop an extended version of the Earley Algorithm (Earley, 1970) to apply the constraints to a reduplicating candidate set.
No associations
LandOfFree
Taking Primitive Optimality Theory Beyond the Finite State does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Taking Primitive Optimality Theory Beyond the Finite State, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Taking Primitive Optimality Theory Beyond the Finite State will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-726536