#16806We then turn to a discussion comparing the linguistic expressiveness of the two formalisms.Unification-based grammar formalisms use structures containing sets of features to describe linguistic objects.
other,4-1-P86-1038,ak
Unification-based grammar formalisms
</term>
use
<term>
structures
</term>
containing sets of
<term>
features
</term>
#16810Unification-based grammar formalisms usestructures containing sets of features to describe linguistic objects.
other,8-1-P86-1038,ak
structures
</term>
containing sets of
<term>
features
</term>
to describe
<term>
linguistic objects
#16814Unification-based grammar formalisms use structures containing sets offeatures to describe linguistic objects.
other,11-1-P86-1038,ak
of
<term>
features
</term>
to describe
<term>
linguistic objects
</term>
. Although
<term>
computational algorithms
#16817Unification-based grammar formalisms use structures containing sets of features to describelinguistic objects.
tech,1-2-P86-1038,ak
linguistic objects
</term>
. Although
<term>
computational algorithms
</term>
for
<term>
unification of feature structures
#16821Althoughcomputational algorithms for unification of feature structures have been worked out in experimental research, these algorithms become quite complicated, and a more precise description of feature structures is desirable.
tech,4-2-P86-1038,ak
computational algorithms
</term>
for
<term>
unification of feature structures
</term>
have been worked out in experimental
#16824Although computational algorithms forunification of feature structures have been worked out in experimental research, these algorithms become quite complicated, and a more precise description of feature structures is desirable.
tech,17-2-P86-1038,ak
out in experimental research , these
<term>
algorithms
</term>
become quite complicated , and a
#16837Although computational algorithms for unification of feature structures have been worked out in experimental research, thesealgorithms become quite complicated, and a more precise description of feature structures is desirable.
other,28-2-P86-1038,ak
and a more precise description of
<term>
feature structures
</term>
is desirable . We have developed
#16848Although computational algorithms for unification of feature structures have been worked out in experimental research, these algorithms become quite complicated, and a more precise description offeature structures is desirable.
model,4-3-P86-1038,ak
is desirable . We have developed a
<term>
model
</term>
in which descriptions of
<term>
feature
#16857We have developed amodel in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them.
other,9-3-P86-1038,ak
model
</term>
in which descriptions of
<term>
feature structures
</term>
can be regarded as
<term>
logical formulas
#16862We have developed a model in which descriptions offeature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them.
tech,15-3-P86-1038,ak
structures
</term>
can be regarded as
<term>
logical formulas
</term>
, and interpreted by sets of
<term>
#16868We have developed a model in which descriptions of feature structures can be regarded aslogical formulas, and interpreted by sets of directed graphs which satisfy them.
tech,23-3-P86-1038,ak
</term>
, and interpreted by sets of
<term>
directed graphs
</term>
which satisfy them . These
<term>
graphs
#16876We have developed a model in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets ofdirected graphs which satisfy them.
tech,1-4-P86-1038,ak
graphs
</term>
which satisfy them . These
<term>
graphs
</term>
are , in fact ,
<term>
transition graphs
#16883Thesegraphs are, in fact, transition graphs for a special type of deterministic finite automaton.
tech,7-4-P86-1038,ak
<term>
graphs
</term>
are , in fact ,
<term>
transition graphs
</term>
for a special type of
<term>
deterministic
#16889These graphs are, in fact,transition graphs for a special type of deterministic finite automaton.
tech,14-4-P86-1038,ak
graphs
</term>
for a special type of
<term>
deterministic finite automaton
</term>
. This
<term>
semantics
</term>
for
<term>
#16896These graphs are, in fact, transition graphs for a special type ofdeterministic finite automaton.
other,1-5-P86-1038,ak
deterministic finite automaton
</term>
. This
<term>
semantics
</term>
for
<term>
feature structures
</term>
#16901Thissemantics for feature structures extends the ideas of Pereira and Shieber [11], by providing an interpretation for values which are specified by disjunctions and path values embedded within disjunctions.
other,3-5-P86-1038,ak
</term>
. This
<term>
semantics
</term>
for
<term>
feature structures
</term>
extends the ideas of Pereira and
#16903This semantics forfeature structures extends the ideas of Pereira and Shieber [11], by providing an interpretation for values which are specified by disjunctions and path values embedded within disjunctions.
other,26-5-P86-1038,ak
for values which are specified by
<term>
disjunctions
</term>
and
<term>
path values
</term>
embedded
#16926This semantics for feature structures extends the ideas of Pereira and Shieber [11], by providing an interpretation for values which are specified bydisjunctions and path values embedded within disjunctions.
other,28-5-P86-1038,ak
specified by
<term>
disjunctions
</term>
and
<term>
path values
</term>
embedded within
<term>
disjunctions
#16928This semantics for feature structures extends the ideas of Pereira and Shieber [11], by providing an interpretation for values which are specified by disjunctions andpath values embedded within disjunctions.
other,32-5-P86-1038,ak
<term>
path values
</term>
embedded within
<term>
disjunctions
</term>
. Our interpretation differs from
#16932This semantics for feature structures extends the ideas of Pereira and Shieber [11], by providing an interpretation for values which are specified by disjunctions and path values embedded withindisjunctions.