| other,0-1-P86-1038,bq | We then turn to a discussion comparing the <term> linguistic expressiveness </term> of the two <term> formalisms </term> . <term> Unification-based grammar formalisms </term> use structures containing sets of <term> features </term> to describe <term> linguistic objects </term> . | #14623 We then turn to a discussion comparing the linguistic expressiveness of the two formalisms.Unification-based grammar formalisms use structures containing sets of features to describe linguistic objects. |
| other,8-1-P86-1038,bq | <term> Unification-based grammar formalisms </term> use structures containing sets of <term> features </term> to describe <term> linguistic objects </term> . | #14631 Unification-based grammar formalisms use structures containing sets offeatures to describe linguistic objects. |
| 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. |
| tech,1-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 . | #14638 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. |
| 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,28-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 . | #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 offeature structures is desirable. |
| model,4-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 . | #14674 We have developed amodel in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them. |
| 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,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,23-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 . | #14693 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,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. |
| 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. |
| 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,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. |
| 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,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,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,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,12-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> . | #14763 Our interpretation differs from that of Pereira and Shieber by using alogical model in place of a denotational semantics. |
| 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. |
