#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.
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-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,4-11-P86-1038,ak
is NP-complete . To deal with this
<term>
complexity
</term>
, we describe how
<term>
disjunctive
#17020To deal with thiscomplexity, we describe how disjunctive values can be specified in a way which delays expansion to disjunctive normal form.
tech,11-9-P86-1038,ak
<term>
computational complexity
</term>
of
<term>
unification
</term>
. We have shown that the
<term>
consistency
#16999Our model allows a careful examination of the computational complexity ofunification.
other,5-10-P86-1038,ak
unification
</term>
. We have shown that the
<term>
consistency problem
</term>
for
<term>
formulas
</term>
with disjunctive
#17006We have shown that theconsistency problem for formulas with disjunctive values is NP-complete.
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.
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,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,5-7-P86-1038,ak
<term>
logical model
</term>
yields a
<term>
calculus of equivalences
</term>
, which can be used to simplify
<term>
#16960This logical model yields acalculus of equivalences, which can be used to simplify formulas.
tech,8-10-P86-1038,ak
<term>
consistency problem
</term>
for
<term>
formulas
</term>
with disjunctive values is NP-complete
#17009We have shown that the consistency problem forformulas with disjunctive values is NP-complete.
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.
other,9-11-P86-1038,ak
complexity
</term>
, we describe how
<term>
disjunctive values
</term>
can be specified in a way which delays
#17025To deal with this complexity, we describe howdisjunctive values can be specified in a way which delays expansion to disjunctive normal form.
model,12-6-P86-1038,ak
of Pereira and Shieber by using a
<term>
logical model
</term>
in place of a
<term>
denotational semantics
#16946Our interpretation differs from that of Pereira and Shieber by using alogical model in place of a denotational semantics.
model,1-7-P86-1038,ak
denotational semantics
</term>
. This
<term>
logical model
</term>
yields a
<term>
calculus of equivalences
#16956Thislogical model yields a calculus of equivalences, which can be used to simplify formulas.
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,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,8-9-P86-1038,ak
allows a careful examination of the
<term>
computational complexity
</term>
of
<term>
unification
</term>
. We have
#16996Our model allows a careful examination of thecomputational complexity of unification.
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.
other,21-11-P86-1038,ak
in a way which delays expansion to
<term>
disjunctive normal form
</term>
. Currently several
<term>
grammatical
#17037To deal with this complexity, we describe how disjunctive values can be specified in a way which delays expansion todisjunctive normal form.