| other,1-4-P86-1038,bq | </term> which satisfy them . These <term> | graphs | </term> are , in fact , <term> transition | #14700 These graphs are, in fact, transition graphs for a special type of deterministic finite automaton. |
| other,1-5-P86-1038,bq | deterministic finite automaton </term> . This <term> | semantics | </term> for <term> feature structures </term> | #14718 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 within disjunctions. |
| 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 simplify formulas . |
| 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 by disjunctions and path values embedded within disjunctions. |
| other,32-5-P86-1038,bq | 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 within disjunctions . |
| other,7-7-P86-1038,bq | model </term> yields a calculus of <term> | equivalences | </term> , which can be used to simplify <term> | #14779 This logical model yields a calculus of equivalences , which can be used to simplify formulas. |
| other,8-1-P86-1038,bq | use structures containing sets of <term> | features | </term> to describe <term> linguistic objects | #14631 Unification-based grammar formalisms use structures containing sets of features to describe linguistic objects. |
| 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 for formulas with disjunctive values is NP-complete. |
| tech,17-2-P86-1038,bq | 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, these algorithms become quite complicated, and a more precise description of feature structures is desirable. |
