| 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 of feature structures is desirable. |
| other,28-5-P86-1038,bq | specified by <term> disjunctions </term> and <term> | path values | </term> embedded within <term> disjunctions | #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 and path values embedded within disjunctions. |
| 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 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-4-P86-1038,bq | <term> graphs </term> are , in fact , <term> | transition graphs | </term> for a special type of <term> deterministic | #14706 These graphs are, in fact, transition graphs for a special type of deterministic finite automaton. |
| other,9-3-P86-1038,bq | model </term> in which descriptions of <term> | feature structures | </term> can be regarded as <term> logical | #14679 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. |
