</term>
, a linguistically motivated formalization
#29451This paper introducesprimitive Optimality Theory ( OTP ), a linguistically motivated formalization of OT.
tech,9-2-P97-1040,ak
autosegmental representations
</term>
, the
<term>
universal generator Gen
</term>
, and the two simple families of
<term>
#29474OTP specifies the class of autosegmental representations, theuniversal generator Gen, and the two simple families of permissible constraints.
tech,7-3-P97-1040,ak
to less restricted theories using
<term>
Generalized Alignment
</term>
,
<term>
OTP 's
</term>
optimal
<term>
#29494In contrast to less restricted theories usingGeneralized Alignment, OTP's optimal surface forms can be generated with finite-state methods adapted from (Ellison, 1994).
tech,5-2-P97-1040,ak
<term>
OTP
</term>
specifies the class of
<term>
autosegmental representations
</term>
, the
<term>
universal generator Gen
#29470OTP specifies the class ofautosegmental representations, the universal generator Gen, and the two simple families of permissible constraints.
tech,11-7-P97-1040,ak
improvements is a new finite-state notion ,
<term>
factored automata
</term>
, where
<term>
regular languages
</term>
#29585One avenue for future improvements is a new finite-state notion,factored automata, where regular languages are represented compactly via formal intersections N~=IAi of FSAs.
model,19-2-P97-1040,ak
</term>
, and the two simple families of
<term>
permissible constraints
</term>
. In contrast to less restricted
#29484OTP specifies the class of autosegmental representations, the universal generator Gen, and the two simple families ofpermissible constraints.
lr,11-4-P97-1040,ak
</term>
exponential on the size of the
<term>
grammar
</term>
. Indeed the
<term>
generation problem
#29527Unfortunately these methods take time exponential on the size of thegrammar.
other,15-1-P97-1040,ak
linguistically motivated formalization of
<term>
OT
</term>
.
<term>
OTP
</term>
specifies the class
#29463This paper introduces primitive Optimality Theory (OTP), a linguistically motivated formalization ofOT.
tech,28-7-P97-1040,ak
formal intersections
</term>
N ~ = IAi of
<term>
FSAs
</term>
. We investigate the problem of determining
#29602One avenue for future improvements is a new finite-state notion, factored automata, where regular languages are represented compactly via formal intersections N~=IAi ofFSAs.
tech,19-3-P97-1040,ak
forms
</term>
can be generated with
<term>
finite-state methods
</term>
adapted from ( Ellison , 1994 ) .
#29506In contrast to less restricted theories using Generalized Alignment, OTP's optimal surface forms can be generated withfinite-state methods adapted from (Ellison, 1994).
tech,15-7-P97-1040,ak
<term>
factored automata
</term>
, where
<term>
regular languages
</term>
are represented compactly via
<term>
#29589One avenue for future improvements is a new finite-state notion, factored automata, whereregular languages are represented compactly via formal intersections N~=IAi of FSAs.
other,13-3-P97-1040,ak
</term>
,
<term>
OTP 's
</term>
optimal
<term>
surface forms
</term>
can be generated with
<term>
finite-state
#29500In contrast to less restricted theories using Generalized Alignment, OTP's optimalsurface forms can be generated with finite-state methods adapted from (Ellison, 1994).
other,4-4-P97-1040,ak
Unfortunately these
<term>
methods
</term>
take
<term>
time
</term>
exponential on the size of the
<term>
#29520Unfortunately these methods taketime exponential on the size of the grammar.
tech,7-6-P97-1040,ak
techniques are discussed for making
<term>
Ellison 's approach
</term>
fast in the typical case , including
#29547However, techniques are discussed for makingEllison 's approach fast in the typical case, including a simple trick that alone provides a 100-fold speedup on a grammar fragment of moderate size.
other,2-5-P97-1040,ak
the
<term>
grammar
</term>
. Indeed the
<term>
generation problem
</term>
is shown NP-complete in this sense
#29531Indeed thegeneration problem is shown NP-complete in this sense.
other,21-7-P97-1040,ak
</term>
are represented compactly via
<term>
formal intersections
</term>
N ~ = IAi of
<term>
FSAs
</term>
. We
#29595One avenue for future improvements is a new finite-state notion, factored automata, where regular languages are represented compactly viaformal intersections N~=IAi of FSAs.
lr,28-6-P97-1040,ak
a
<term>
100-fold speedup
</term>
on a
<term>
grammar fragment
</term>
of moderate size . One avenue for
#29568However, techniques are discussed for making Ellison's approach fast in the typical case, including a simple trick that alone provides a 100-fold speedup on agrammar fragment of moderate size.
other,24-6-P97-1040,ak
simple trick that alone provides a
<term>
100-fold speedup
</term>
on a
<term>
grammar fragment
</term>
#29564However, techniques are discussed for making Ellison's approach fast in the typical case, including a simple trick that alone provides a100-fold speedup on a grammar fragment of moderate size.
other,10-3-P97-1040,ak
<term>
Generalized Alignment
</term>
,
<term>
OTP 's
</term>
optimal
<term>
surface forms
</term>
#29497In contrast to less restricted theories using Generalized Alignment,OTP 's optimal surface forms can be generated with finite-state methods adapted from (Ellison, 1994).
other,0-2-P97-1040,ak
motivated formalization of
<term>
OT
</term>
.
<term>
OTP
</term>
specifies the class of
<term>
autosegmental
#29465This paper introduces primitive Optimality Theory (OTP), a linguistically motivated formalization of OT.OTP specifies the class of autosegmental representations, the universal generator Gen, and the two simple families of permissible constraints.