| other,0-1-P86-1038,ak | 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 <term> structures </term> containing sets of <term> features </term> to describe <term> linguistic objects </term> . | #16806 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,4-1-P86-1038,ak | <term> Unification-based grammar formalisms </term> use <term> structures </term> containing sets of <term> features </term> to describe <term> linguistic objects </term> . | #16810 Unification-based grammar formalisms usestructures containing sets of features to describe linguistic objects. | |
| other,8-1-P86-1038,ak | <term> Unification-based grammar formalisms </term> use <term> structures </term> containing sets of <term> features </term> to describe <term> linguistic objects </term> . | #16814 Unification-based grammar formalisms use structures containing sets offeatures to describe linguistic objects. | |
| other,11-1-P86-1038,ak | <term> Unification-based grammar formalisms </term> use <term> structures </term> containing sets of <term> features </term> to describe <term> linguistic objects </term> . | #16817 Unification-based grammar formalisms use structures containing sets of features to describelinguistic objects. | |
| tech,1-2-P86-1038,ak | Although <term> computational algorithms </term> for <term> 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 . | #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. | |
| tech,4-2-P86-1038,ak | Although <term> computational algorithms </term> for <term> 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 . | #16824 Although computational algorithms forunification 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,ak | Although <term> computational algorithms </term> for <term> 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 . | #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. | |
| other,28-2-P86-1038,ak | Although <term> computational algorithms </term> for <term> 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 . | #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. | |
| model,4-3-P86-1038,ak | 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 . | #16857 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,ak | 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 . | #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. | |
| tech,15-3-P86-1038,ak | 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 . | #16868 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. | |
| tech,23-3-P86-1038,ak | 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 . | #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. | |
| tech,1-4-P86-1038,ak | These <term> graphs </term> are , in fact , <term> transition graphs </term> for a special type of <term> deterministic finite automaton </term> . | #16883 Thesegraphs are, in fact, transition graphs for a special type of deterministic finite automaton. | |
| tech,7-4-P86-1038,ak | These <term> graphs </term> are , in fact , <term> transition graphs </term> for a special type of <term> deterministic finite automaton </term> . | #16889 These graphs are, in fact,transition graphs for a special type of deterministic finite automaton. | |
| tech,14-4-P86-1038,ak | These <term> graphs </term> are , in fact , <term> transition graphs </term> for a special type of <term> deterministic finite automaton </term> . | #16896 These graphs are, in fact, transition graphs for a special type ofdeterministic finite automaton. | |
| other,1-5-P86-1038,ak | 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> . | #16901 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,ak | 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> . | #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,26-5-P86-1038,ak | 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> . | #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,28-5-P86-1038,ak | 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> . | #16928 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,ak | 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> . | #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. |
