other,1-7-P86-1038,bq |
denotational semantics
</term>
. This
<term>
|
logical model
|
</term>
yields a calculus of
<term>
equivalences
|
#14773
Thislogical model yields a calculus of equivalences, which can be used to simplify formulas. |
other,9-3-P86-1038,bq |
model
</term>
in which descriptions of
<term>
|
feature structures
|
</term>
can be regarded as
<term>
logical formulas
|
#14679
We 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. |
other,15-7-P86-1038,bq |
</term>
, which can be used to simplify
<term>
|
formulas
|
</term>
.
<term>
Unification
</term>
is attractive
|
#14787
This logical model yields a calculus of equivalences, which can be used to simplifyformulas. |
other,26-5-P86-1038,bq |
for values which are specified by
<term>
|
disjunctions
|
</term>
and
<term>
path values
</term>
embedded
|
#14743
This 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,8-1-P86-1038,bq |
</term>
use structures containing sets of
<term>
|
features
|
</term>
to describe
<term>
linguistic objects
|
#14631
Unification-based grammar formalisms use structures containing sets offeatures to describe linguistic objects. |
other,28-2-P86-1038,bq |
and a more precise description of
<term>
|
feature structures
|
</term>
is desirable . We have developed
|
#14665
Although 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. |
other,28-5-P86-1038,bq |
specified by
<term>
disjunctions
</term>
and
<term>
|
path values
|
</term>
embedded within
<term>
disjunctions
|
#14745
This 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. |
tech,0-8-P86-1038,bq |
to simplify
<term>
formulas
</term>
.
<term>
|
Unification
|
</term>
is attractive , because of its generality
|
#14789
This logical model yields a calculus of equivalences, which can be used to simplify formulas.Unification is attractive, because of its generality, but it is often computationally inefficient. |
other,8-9-P86-1038,bq |
allows a careful examination of the
<term>
|
computational complexity
|
</term>
of
<term>
unification
</term>
. We have
|
#14813
Our model allows a careful examination of thecomputational complexity of unification. |
tech,11-9-P86-1038,bq |
<term>
computational complexity
</term>
of
<term>
|
unification
|
</term>
. We have shown that the
<term>
consistency
|
#14816
Our model allows a careful examination of the computational complexity ofunification. |
tech,17-2-P86-1038,bq |
out in experimental research , these
<term>
|
algorithms
|
</term>
become quite complicated , and a
|
#14654
Although 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,7-4-P86-1038,bq |
<term>
graphs
</term>
are , in fact ,
<term>
|
transition graphs
|
</term>
for a special type of
<term>
deterministic
|
#14706
These graphs are, in fact,transition graphs for a special type of deterministic finite automaton. |
other,32-5-P86-1038,bq |
<term>
path values
</term>
embedded within
<term>
|
disjunctions
|
</term>
. Our interpretation differs from
|
#14749
This 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. |
other,1-4-P86-1038,bq |
graphs
</term>
which satisfy them . These
<term>
|
graphs
|
</term>
are , in fact ,
<term>
transition graphs
|
#14700
Thesegraphs are, in fact, transition graphs for a special type of deterministic finite automaton. |
model,4-3-P86-1038,bq |
is desirable . We have developed a
<term>
|
model
|
</term>
in which descriptions of
<term>
feature
|
#14674
We 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,7-7-P86-1038,bq |
logical model
</term>
yields a calculus of
<term>
|
equivalences
|
</term>
, which can be used to simplify
<term>
|
#14779
This logical model yields a calculus ofequivalences, which can be used to simplify formulas. |
other,8-10-P86-1038,bq |
<term>
consistency problem
</term>
for
<term>
|
formulas
|
</term>
with
<term>
disjunctive values
</term>
|
#14826
We have shown that the consistency problem forformulas with disjunctive values is NP-complete. |
other,3-5-P86-1038,bq |
</term>
. This
<term>
semantics
</term>
for
<term>
|
feature structures
|
</term>
extends the ideas of Pereira and
|
#14720
This 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. |
tech,14-4-P86-1038,bq |
graphs
</term>
for a special type of
<term>
|
deterministic finite automaton
|
</term>
. This
<term>
semantics
</term>
for
<term>
|
#14713
These graphs are, in fact, transition graphs for a special type ofdeterministic finite automaton. |
other,12-6-P86-1038,bq |
of Pereira and Shieber by using a
<term>
|
logical model
|
</term>
in place of a
<term>
denotational semantics
|
#14763
Our interpretation differs from that of Pereira and Shieber by using alogical model in place of a denotational semantics. |