Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CORR
2000
Springer

favoriteEmaildiscussreport

89views Education» more CORR 2000»

Approximation and Exactness in Finite State Optimality Theory

13 years 4 months ago

Approximation and Exactness in Finite State Optimality Theory

Download www.let.rug.nl

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

Dale Gerdemann, Gertjan van Noord

Real-time Traffic

CORR 2000 | Education | Gradient Constraints | Optimality Theory | Syllabification Analysis |

claim paper

Related Content

» Symbolic Reachability Analysis of Large Finite State Machines Using Dont Cares

» Exact finite approximations of averagecost countable Markov decision processes

» Numerical optimal control of the wave equation optimal boundary control of a string to res...

» Exact solutions of interactive POMDPs using behavioral equivalence

» Exact determinations of the maximal output admissible set for a class of nonlinear systems

» Optimal Metric Planning with State Sets in Automata Representation

» An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs

» A neural network implementing optimal state estimation based on dynamic spike train decodi...

» Symbolic exploration of large circuits with enhanced forwardbackward traversals

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	CORR
Authors	Dale Gerdemann, Gertjan van Noord

Comments (0)