| tech,17-2-P86-1038,ak | out in experimental research , these <term> | algorithms | </term> become quite complicated , and a | #16837 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. | |
| tech,5-7-P86-1038,ak | <term> logical model </term> yields a <term> | calculus of equivalences | </term> , which can be used to simplify <term> | #16960 This logical model yields acalculus of equivalences, which can be used to simplify formulas. | |
| other,4-11-P86-1038,ak | is NP-complete . To deal with this <term> | complexity | </term> , we describe how <term> disjunctive | #17020 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,ak | linguistic objects </term> . Although <term> | computational algorithms | </term> for <term> unification of feature structures | #16821 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,ak | allows a careful examination of the <term> | computational complexity | </term> of <term> unification </term> . We have | #16996 Our model allows a careful examination of thecomputational complexity of unification. | |
| other,5-10-P86-1038,ak | unification </term> . We have shown that the <term> | consistency problem | </term> for <term> formulas </term> with disjunctive | #17006 We have shown that theconsistency problem for formulas with disjunctive values is NP-complete. | |
| other,18-6-P86-1038,ak | <term> logical model </term> in place of a <term> | denotational semantics | </term> . This <term> logical model </term> yields | #16952 Our interpretation differs from that of Pereira and Shieber by using a logical model in place of adenotational semantics. | |
| tech,14-4-P86-1038,ak | graphs </term> for a special type of <term> | deterministic finite automaton | </term> . This <term> semantics </term> for <term> | #16896 These graphs are, in fact, transition graphs for a special type ofdeterministic finite automaton. | |
| tech,23-3-P86-1038,ak | </term> , and interpreted by sets of <term> | directed graphs | </term> which satisfy them . These <term> graphs | #16876 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,ak | for values which are specified by <term> | disjunctions | </term> and <term> path values </term> embedded | #16926 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,ak | <term> path values </term> embedded within <term> | disjunctions | </term> . Our interpretation differs from | #16932 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,21-11-P86-1038,ak | in a way which delays expansion to <term> | disjunctive normal form | </term> . Currently several <term> grammatical | #17037 To deal with this complexity, we describe how disjunctive values can be specified in a way which delays expansion todisjunctive normal form. | |
| other,9-11-P86-1038,ak | complexity </term> , we describe how <term> | disjunctive values | </term> can be specified in a way which delays | #17025 To deal with this complexity, we describe howdisjunctive values can be specified in a way which delays expansion to disjunctive normal form. | |
| other,28-2-P86-1038,ak | and a more precise description of <term> | feature structures | </term> is desirable . We have developed | #16848 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,9-3-P86-1038,ak | model </term> in which descriptions of <term> | feature structures | </term> can be regarded as <term> logical formulas | #16862 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,3-5-P86-1038,ak | </term> . This <term> semantics </term> for <term> | feature structures | </term> extends the ideas of Pereira and | #16903 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,ak | structures </term> containing sets of <term> | features | </term> to describe <term> linguistic objects | #16814 Unification-based grammar formalisms use structures containing sets offeatures to describe linguistic objects. | |
| tech,15-7-P86-1038,ak | </term> , which can be used to simplify <term> | formulas | </term> . <term> Unification </term> is attractive | #16970 This logical model yields a calculus of equivalences, which can be used to simplifyformulas. | |
| tech,8-10-P86-1038,ak | <term> consistency problem </term> for <term> | formulas | </term> with disjunctive values is NP-complete | #17009 We have shown that the consistency problem forformulas with disjunctive values is NP-complete. | |
| tech,1-4-P86-1038,ak | graphs </term> which satisfy them . These <term> | graphs | </term> are , in fact , <term> transition graphs | #16883 Thesegraphs are, in fact, transition graphs for a special type of deterministic finite automaton. |
