other,19-5-C88-1066,bq |
well-formedness conditions
</term>
on
<term>
|
trees
|
</term>
. / Soames 1979 / provides some counterexamples
|
#15344
Special attention is given to the part of the parser that checks the fulfillment of logical well-formedness conditions ontrees. |
other,18-4-C88-1066,bq |
languages
</term>
can be adapted to the
<term>
|
CCR formalism
|
</term>
. Special attention is given to the
|
#15322
The paper shows how conventional algorithms for the analysis of context free languages can be adapted to theCCR formalism. |
other,11-3-C88-1066,bq |
descriptions
</term>
formulated entirely with
<term>
|
restrictive statements
|
</term>
. The paper shows how conventional
|
#15301
The use of CCRs leads to syntactic descriptions formulated entirely withrestrictive statements. |
other,26-2-C88-1066,bq |
can not be captured in other current
<term>
|
syntax formalisms
|
</term>
. The use of
<term>
CCRs
</term>
leads
|
#15287
CCRs 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,6-1-C88-1066,bq |
paper summarizes the formalism of
<term>
|
Category Cooccurrence Restrictions ( CCRs )
|
</term>
and describes two
<term>
parsing algorithms
|
#15246
This paper summarizes the formalism ofCategory Cooccurrence Restrictions ( CCRs ) and describes two parsing algorithms that interpret it. |
other,10-4-C88-1066,bq |
conventional algorithms for the analysis of
<term>
|
context free languages
|
</term>
can be adapted to the
<term>
CCR formalism
|
#15314
The paper shows how conventional algorithms for the analysis ofcontext free languages can be adapted to the CCR formalism. |
other,6-3-C88-1066,bq |
The use of
<term>
CCRs
</term>
leads to
<term>
|
syntactic descriptions
|
</term>
formulated entirely with
<term>
restrictive
|
#15296
The use of CCRs leads tosyntactic descriptions formulated entirely with restrictive statements. |
other,8-2-C88-1066,bq |
conditions
</term>
on the cooccurrence of
<term>
|
categories
|
</term>
in
<term>
local trees
</term>
which allow
|
#15269
CCRs are Boolean conditions on the cooccurrence ofcategories in local trees which allow the statement of generalizations which cannot be captured in other current syntax formalisms. |
other,2-2-C88-1066,bq |
interpret it .
<term>
CCRs
</term>
are
<term>
|
Boolean conditions
|
</term>
on the cooccurrence of
<term>
categories
|
#15263
CCRs 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,15-5-C88-1066,bq |
</term>
that checks the fulfillment of
<term>
|
logical well-formedness conditions
|
</term>
on
<term>
trees
</term>
. / Soames 1979
|
#15340
Special attention is given to the part of the parser that checks the fulfillment oflogical well-formedness conditions on trees. |
tech,9-5-C88-1066,bq |
attention is given to the part of the
<term>
|
parser
|
</term>
that checks the fulfillment of
<term>
|
#15334
Special attention is given to the part of theparser that checks the fulfillment of logical well-formedness conditions on trees. |
tech,15-1-C88-1066,bq |
Restrictions ( CCRs )
</term>
and describes two
<term>
|
parsing algorithms
|
</term>
that interpret it .
<term>
CCRs
</term>
|
#15255
This paper summarizes the formalism of Category Cooccurrence Restrictions (CCRs) and describes twoparsing algorithms that interpret it. |
other,10-2-C88-1066,bq |
cooccurrence of
<term>
categories
</term>
in
<term>
|
local trees
|
</term>
which allow the
<term>
statement of
|
#15271
CCRs 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. |
other,15-2-C88-1066,bq |
<term>
local trees
</term>
which allow the
<term>
|
statement of generalizations
|
</term>
which can not be captured in other
|
#15276
CCRs are Boolean conditions on the cooccurrence of categories in local trees which allow thestatement of generalizations which cannot be captured in other current syntax formalisms. |