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,4-11-P86-1038,bq |
NP-complete
</term>
. To deal with this
<term>
|
complexity
|
</term>
, we describe how
<term>
disjunctive
|
#14837
To deal with thiscomplexity, we describe how disjunctive values can be specified in a way which delays expansion to disjunctive normal form. |
tech,1-2-P86-1038,bq |
linguistic objects
</term>
. Although
<term>
|
computational algorithms for unification of feature structures
|
</term>
have been worked out in experimental
|
#14638
Althoughcomputational 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,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. |
other,5-10-P86-1038,bq |
unification
</term>
. We have shown that the
<term>
|
consistency problem
|
</term>
for
<term>
formulas
</term>
with
<term>
|
#14823
We have shown that theconsistency problem for formulas with disjunctive values is NP-complete. |
other,18-6-P86-1038,bq |
<term>
logical model
</term>
in place of a
<term>
|
denotational semantics
|
</term>
. This
<term>
logical model
</term>
yields
|
#14769
Our interpretation differs from that of Pereira and Shieber by using a logical model in place of adenotational semantics. |
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,23-3-P86-1038,bq |
</term>
, and interpreted by sets of
<term>
|
directed graphs
|
</term>
which satisfy them . These
<term>
graphs
|
#14693
We 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. |
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,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,9-11-P86-1038,bq |
complexity
</term>
, we describe how
<term>
|
disjunctive
|
</term>
values can be specified in a way
|
#14842
To deal with this complexity, we describe howdisjunctive values can be specified in a way which delays expansion to disjunctive normal form. |
other,21-11-P86-1038,bq |
which delays
<term>
expansion
</term>
to
<term>
|
disjunctive normal form
|
</term>
. This paper describes a domain independent
|
#14854
To deal with this complexity, we describe how disjunctive values can be specified in a way which delays expansion todisjunctive normal form. |
other,10-10-P86-1038,bq |
</term>
for
<term>
formulas
</term>
with
<term>
|
disjunctive values
|
</term>
is
<term>
NP-complete
</term>
. To deal
|
#14828
We have shown that the consistency problem for formulas withdisjunctive values is NP-complete. |
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. |
tech,19-11-P86-1038,bq |
be specified in a way which delays
<term>
|
expansion
|
</term>
to
<term>
disjunctive normal form
</term>
|
#14852
To deal with this complexity, we describe how disjunctive values can be specified in a way which delaysexpansion to disjunctive normal form. |
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,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,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. |
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,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. |