Approximation and Exactness in Finite State Optimality Theory

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-490058

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.