| other,19-5-C88-1066,bq | well-formedness conditions </term> on <term> | trees | </term> . / Soames 1979 / provides some | #15344 Special attention is given to the part of the parser that checks the fulfillment of logical well-formedness conditions on trees . |
| other,0-2-C88-1066,bq | algorithms </term> that interpret it . <term> | CCRs | </term> are <term> Boolean conditions </term> | #15261 This paper summarizes the formalism of Category Cooccurrence Restrictions (CCRs) and describes two parsing algorithms that interpret it. CCRs are Boolean conditions on the cooccurrence of categories in local trees which allow the statement of generalizations which cannot be captured in other current syntax formalisms. |
| other,8-2-C88-1066,bq | conditions </term> on the cooccurrence of <term> | categories | </term> in <term> local trees </term> which | #15269 CCRs are Boolean conditions on the cooccurrence of categories in local trees which allow the statement of generalizations which cannot be captured in other current syntax formalisms. |
| other,3-3-C88-1066,bq | syntax formalisms </term> . The use of <term> | CCRs | </term> leads to <term> syntactic descriptions | #15293 The use of CCRs leads to syntactic descriptions formulated entirely with restrictive statements. |
