</term>
which allow the statement of generalizations
#18118CCRs are Boolean conditions on the cooccurrence of categories inlocal trees which allow the statement of generalizations which cannot be captured in other current syntax formalisms.
model,15-5-C88-1066,ak
</term>
that checks the fulfillment of
<term>
logical well-formedness conditions
</term>
on
<term>
trees
</term>
. / Soames 1979
#18187Special attention is given to the part of the parser that checks the fulfillment oflogical well-formedness conditions on trees.
model,19-5-C88-1066,ak
well-formedness conditions
</term>
on
<term>
trees
</term>
. / Soames 1979 / provides some counterexamples
#18191Special attention is given to the part of the parser that checks the fulfillment of logical well-formedness conditions ontrees.
model,2-2-C88-1066,ak
interpret it .
<term>
CCRs
</term>
are
<term>
Boolean conditions
</term>
on the
<term>
cooccurrence
</term>
of
#18110CCRs areBoolean 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,0-2-C88-1066,ak
algorithms
</term>
that interpret it .
<term>
CCRs
</term>
are
<term>
Boolean conditions
</term>
#18108This 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,10-4-C88-1066,ak
algorithms
</term>
for the analysis of
<term>
context free languages
</term>
can be adapted to the
<term>
CCR formalism
#18161The paper shows how conventional algorithms for the analysis ofcontext free languages can be adapted to the CCR formalism.
other,18-4-C88-1066,ak
languages
</term>
can be adapted to the
<term>
CCR formalism
</term>
. Special attention is given to the
#18169The paper shows how conventional algorithms for the analysis of context free languages can be adapted to theCCR formalism.
other,26-2-C88-1066,ak
can not be captured in other current
<term>
syntax formalisms
</term>
. The use of
<term>
CCRs
</term>
leads
#18134CCRs are Boolean conditions on the cooccurrence of categories in local trees which allow the statement of generalizations which cannot be captured in other currentsyntax formalisms.
other,3-3-C88-1066,ak
syntax formalisms
</term>
. The use of
<term>
CCRs
</term>
leads to
<term>
syntactic descriptions
#18140The use ofCCRs leads to syntactic descriptions formulated entirely with restrictive statements.
other,6-1-C88-1066,ak
paper summarizes the formalism of
<term>
Category Cooccurrence Restrictions ( CCRs )
</term>
and describes two
<term>
parsing algorithms
#18093This paper summarizes the formalism ofCategory Cooccurrence Restrictions ( CCRs ) and describes two parsing algorithms that interpret it.
other,6-2-C88-1066,ak
<term>
Boolean conditions
</term>
on the
<term>
cooccurrence
</term>
of categories in
<term>
local trees
#18114CCRs are Boolean conditions on thecooccurrence of categories in local trees which allow the statement of generalizations which cannot be captured in other current syntax formalisms.
other,6-3-C88-1066,ak
The use of
<term>
CCRs
</term>
leads to
<term>
syntactic descriptions
</term>
formulated entirely with restrictive
#18143The use of CCRs leads tosyntactic descriptions formulated entirely with restrictive statements.
tech,15-1-C88-1066,ak
Restrictions ( CCRs )
</term>
and describes two
<term>
parsing algorithms
</term>
that interpret it .
<term>
CCRs
</term>
#18102This paper summarizes the formalism of Category Cooccurrence Restrictions (CCRs) and describes twoparsing algorithms that interpret it.
tech,5-4-C88-1066,ak
. The paper shows how conventional
<term>
algorithms
</term>
for the analysis of
<term>
context
#18156The paper shows how conventionalalgorithms for the analysis of context free languages can be adapted to the CCR formalism.
tech,9-5-C88-1066,ak
attention is given to the part of the
<term>
parser
</term>
that checks the fulfillment of
<term>
#18181Special attention is given to the part of theparser that checks the fulfillment of logical well-formedness conditions on trees.