Computer Science – Computation and Language
Scientific paper
2000-06-28
Computer Science
Computation and Language
10 pages, 1 figure, Finite-State Phonology : SIGPHON 2000, Fifth Meeting of the ACL Special Interest Group in Computational Ph
Scientific paper
Previous work (Frank and Satta 1998; Karttunen, 1998) has shown that Optimality Theory with gradient constraints generally is not finite state. A new finite-state treatment of gradient constraints is presented which improves upon the approximation of Karttunen (1998). The method turns out to be exact, and very compact, for the syllabification analysis of Prince and Smolensky (1993).
Gerdemann Dale
Noord Gertjan van
No associations
LandOfFree
Approximation and Exactness in Finite State Optimality Theory 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 Approximation and Exactness in Finite State Optimality Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation and Exactness in Finite State Optimality Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-490058