| other,0-2-C88-1066,ak | algorithms </term> that interpret it . <term> | CCRs | </term> are <term> Boolean conditions </term> | #18108 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. | |
| tech,5-4-C88-1066,ak | The paper shows how conventional <term> | algorithms | </term> for the analysis of <term> context | #18156 The paper shows how conventional algorithms for the analysis of context free languages can be adapted to the CCR formalism. | |
| other,3-3-C88-1066,ak | syntax formalisms </term> . The use of <term> | CCRs | </term> leads to <term> syntactic descriptions | #18140 The use of CCRs leads to syntactic descriptions formulated entirely with restrictive statements. | |
| model,19-5-C88-1066,ak | well-formedness conditions </term> on <term> | trees | </term> . / Soames 1979 / provides some | #18191 Special attention is given to the part of the parser that checks the fulfillment of logical well-formedness conditions on trees . |
