other,15-3-P86-1038,bq |
We have developed a
<term>
model
</term>
in which descriptions of
<term>
feature structures
</term>
can be regarded as
<term>
logical formulas
</term>
, and interpreted by sets of
<term>
directed graphs
</term>
which satisfy them .
|
#14685
We 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. |
other,4-11-P86-1038,bq |
To deal with this
<term>
complexity
</term>
, we describe how
<term>
disjunctive
</term>
values can be specified in a way which delays
<term>
expansion
</term>
to
<term>
disjunctive normal form
</term>
.
|
#14837
To deal with thiscomplexity, we describe how disjunctive values can be specified in a way which delays expansion to disjunctive normal form. |
other,7-7-P86-1038,bq |
This
<term>
logical model
</term>
yields a calculus of
<term>
equivalences
</term>
, which can be used to simplify
<term>
formulas
</term>
.
|
#14779
This logical model yields a calculus ofequivalences, which can be used to simplify formulas. |
other,11-1-P86-1038,bq |
<term>
Unification-based grammar formalisms
</term>
use structures containing sets of
<term>
features
</term>
to describe
<term>
linguistic objects
</term>
.
|
#14634
Unification-based grammar formalisms use structures containing sets of features to describelinguistic objects. |
other,32-5-P86-1038,bq |
This
<term>
semantics
</term>
for
<term>
feature structures
</term>
extends the ideas of Pereira and Shieber [ 11 ] , by providing an interpretation for values which are specified by
<term>
disjunctions
</term>
and
<term>
path values
</term>
embedded within
<term>
disjunctions
</term>
.
|
#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,18-6-P86-1038,bq |
Our interpretation differs from that of Pereira and Shieber by using a
<term>
logical model
</term>
in place of a
<term>
denotational semantics
</term>
.
|
#14769
Our interpretation differs from that of Pereira and Shieber by using a logical model in place of adenotational semantics. |
other,21-11-P86-1038,bq |
To deal with this
<term>
complexity
</term>
, we describe how
<term>
disjunctive
</term>
values can be specified in a way which delays
<term>
expansion
</term>
to
<term>
disjunctive normal form
</term>
.
|
#14854
To deal with this complexity, we describe how disjunctive values can be specified in a way which delays expansion todisjunctive normal form. |
tech,14-4-P86-1038,bq |
These
<term>
graphs
</term>
are , in fact ,
<term>
transition graphs
</term>
for a special type of
<term>
deterministic finite automaton
</term>
.
|
#14713
These graphs are, in fact, transition graphs for a special type ofdeterministic finite automaton. |
other,13-10-P86-1038,bq |
We have shown that the
<term>
consistency problem
</term>
for
<term>
formulas
</term>
with
<term>
disjunctive values
</term>
is
<term>
NP-complete
</term>
.
|
#14831
We have shown that the consistency problem for formulas with disjunctive values isNP-complete. |
other,15-7-P86-1038,bq |
This
<term>
logical model
</term>
yields a calculus of
<term>
equivalences
</term>
, which can be used to simplify
<term>
formulas
</term>
.
|
#14787
This logical model yields a calculus of equivalences, which can be used to simplifyformulas. |
tech,11-9-P86-1038,bq |
Our
<term>
model
</term>
allows a careful examination of the
<term>
computational complexity
</term>
of
<term>
unification
</term>
.
|
#14816
Our model allows a careful examination of the computational complexity ofunification. |
other,1-9-P86-1038,bq |
Our
<term>
model
</term>
allows a careful examination of the
<term>
computational complexity
</term>
of
<term>
unification
</term>
.
|
#14806
Ourmodel allows a careful examination of the computational complexity of unification. |
other,26-5-P86-1038,bq |
This
<term>
semantics
</term>
for
<term>
feature structures
</term>
extends the ideas of Pereira and Shieber [ 11 ] , by providing an interpretation for values which are specified by
<term>
disjunctions
</term>
and
<term>
path values
</term>
embedded within
<term>
disjunctions
</term>
.
|
#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,1-4-P86-1038,bq |
These
<term>
graphs
</term>
are , in fact ,
<term>
transition graphs
</term>
for a special type of
<term>
deterministic finite automaton
</term>
.
|
#14700
Thesegraphs are, in fact, transition graphs for a special type of deterministic finite automaton. |
tech,17-2-P86-1038,bq |
Although
<term>
computational algorithms for unification of feature structures
</term>
have been worked out in experimental research , these
<term>
algorithms
</term>
become quite complicated , and a more precise description of
<term>
feature structures
</term>
is desirable .
|
#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,9-3-P86-1038,bq |
We have developed a
<term>
model
</term>
in which descriptions of
<term>
feature structures
</term>
can be regarded as
<term>
logical formulas
</term>
, and interpreted by sets of
<term>
directed graphs
</term>
which satisfy them .
|
#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-5-P86-1038,bq |
This
<term>
semantics
</term>
for
<term>
feature structures
</term>
extends the ideas of Pereira and Shieber [ 11 ] , by providing an interpretation for values which are specified by
<term>
disjunctions
</term>
and
<term>
path values
</term>
embedded within
<term>
disjunctions
</term>
.
|
#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. |
other,3-5-P86-1038,bq |
This
<term>
semantics
</term>
for
<term>
feature structures
</term>
extends the ideas of Pereira and Shieber [ 11 ] , by providing an interpretation for values which are specified by
<term>
disjunctions
</term>
and
<term>
path values
</term>
embedded within
<term>
disjunctions
</term>
.
|
#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,7-4-P86-1038,bq |
These
<term>
graphs
</term>
are , in fact ,
<term>
transition graphs
</term>
for a special type of
<term>
deterministic finite automaton
</term>
.
|
#14706
These graphs are, in fact,transition graphs for a special type of deterministic finite automaton. |
other,1-5-P86-1038,bq |
This
<term>
semantics
</term>
for
<term>
feature structures
</term>
extends the ideas of Pereira and Shieber [ 11 ] , by providing an interpretation for values which are specified by
<term>
disjunctions
</term>
and
<term>
path values
</term>
embedded within
<term>
disjunctions
</term>
.
|
#14718
Thissemantics 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. |