| algorithms </term> become quite complicated , and | a | more precise description of <term> feature | #14660 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. | |
| </term> is desirable . We have developed | a | <term> model </term> in which descriptions | #14673 We have developed a model in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them. | |
| fact , <term> transition graphs </term> for | a | special type of <term> deterministic finite | #14709 These graphs are, in fact, transition graphs for a special type of deterministic finite automaton. | |
| from that of Pereira and Shieber by using | a | <term> logical model </term> in place of a | #14762 Our interpretation differs from that of Pereira and Shieber by using a logical model in place of a denotational semantics. | |
| a <term> logical model </term> in place of | a | <term> denotational semantics </term> . This | #14768 Our interpretation differs from that of Pereira and Shieber by using a logical model in place of a denotational semantics. | |
| </term> . This <term> logical model </term> yields | a | calculus of <term> equivalences </term> , which | #14776 This logical model yields a calculus of equivalences, which can be used to simplify formulas. | |
| inefficient . Our <term> model </term> allows | a | careful examination of the <term> computational | #14808 Our model allows a careful examination of the computational complexity of unification. | |
| disjunctive </term> values can be specified in | a | way which delays <term> expansion </term> to | #14848 To deal with this complexity, we describe how disjunctive values can be specified in a way which delays expansion to disjunctive normal form. |
