other,51P011007,bq 
scalable . The theoretical study of the
<term>

range concatenation grammar [ RCG ] formalism

</term>
has revealed many attractive properties

#1602
The theoretical study of therange concatenation grammar [ RCG ] formalism has revealed many attractive properties which may be used in NLP. 
tech,221P011007,bq 
attractive properties which may be used in
<term>

NLP

</term>
. In particular ,
<term>
range concatenation

#1619
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used inNLP. 
other,32P011007,bq 
in
<term>
NLP
</term>
. In particular ,
<term>

range concatenation languages [ RCL ]

</term>
can be parsed in
<term>
polynomial

#1624
In particular,range concatenation languages [ RCL ] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing their worstcase parsing time complexity. 
other,132P011007,bq 
languages [ RCL ]
</term>
can be parsed in
<term>

polynomial time

</term>
and many classical
<term>
grammatical

#1634
In particular, range concatenation languages [RCL] can be parsed inpolynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing their worstcase parsing time complexity. 
other,182P011007,bq 
polynomial time
</term>
and many classical
<term>

grammatical formalisms

</term>
can be translated into equivalent

#1639
In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classicalgrammatical formalisms can be translated into equivalent RCGs without increasing their worstcase parsing time complexity. 
other,252P011007,bq 
</term>
can be translated into equivalent
<term>

RCGs

</term>
without increasing their
<term>
worstcase

#1646
In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalentRCGs without increasing their worstcase parsing time complexity. 
other,292P011007,bq 
RCGs
</term>
without increasing their
<term>

worstcase parsing time complexity

</term>
. For example , after
<term>
translation

#1650
In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing theirworstcase parsing time complexity. 
tech,43P011007,bq 
complexity
</term>
. For example , after
<term>

translation

</term>
into an equivalent
<term>
RCG
</term>

#1659
For example, aftertranslation into an equivalent RCG, any tree adjoining grammar can be parsed in O(n6) time. 
other,83P011007,bq 
translation
</term>
into an equivalent
<term>

RCG

</term>
, any
<term>
tree adjoining grammar

#1663
For example, after translation into an equivalentRCG, any tree adjoining grammar can be parsed in O(n6) time. 
lr,113P011007,bq 
an equivalent
<term>
RCG
</term>
, any
<term>

tree adjoining grammar

</term>
can be parsed in
<term>
O ( n6 ) time

#1666
For example, after translation into an equivalent RCG, anytree adjoining grammar can be parsed in O(n6) time. 
other,183P011007,bq 
adjoining grammar
</term>
can be parsed in
<term>

O ( n6 ) time

</term>
. In this paper , we study a
<term>

#1673
For example, after translation into an equivalent RCG, any tree adjoining grammar can be parsed inO ( n6 ) time. 
tech,74P011007,bq 
</term>
. In this paper , we study a
<term>

parsing technique

</term>
whose purpose is to improve the practical

#1686
In this paper, we study aparsing technique whose purpose is to improve the practical efficiency of RCL parsers. 
tech,184P011007,bq 
improve the practical efficiency of
<term>

RCL parsers

</term>
. The
<term>
nondeterministic parsing

#1697
In this paper, we study a parsing technique whose purpose is to improve the practical efficiency ofRCL parsers. 
other,15P011007,bq 
efficiency of
<term>
RCL parsers
</term>
. The
<term>

nondeterministic parsing choices

</term>
of the
<term>
main parser
</term>
for

#1701
Thenondeterministic parsing choices of the main parser for a language L are directed by a guide which uses the shared derivation forest output by a prior RCL parser for a suitable superset of L. 
tech,65P011007,bq 
nondeterministic parsing choices
</term>
of the
<term>

main parser

</term>
for a
<term>
language L
</term>
are directed

#1706
The nondeterministic parsing choices of themain parser for a language L are directed by a guide which uses the shared derivation forest output by a prior RCL parser for a suitable superset of L. 
other,105P011007,bq 
of the
<term>
main parser
</term>
for a
<term>

language L

</term>
are directed by a
<term>
guide
</term>

#1710
The nondeterministic parsing choices of the main parser for alanguage L are directed by a guide which uses the shared derivation forest output by a prior RCL parser for a suitable superset of L. 
tech,165P011007,bq 
language L
</term>
are directed by a
<term>

guide

</term>
which uses the
<term>
shared derivation

#1716
The nondeterministic parsing choices of the main parser for a language L are directed by aguide which uses the shared derivation forest output by a prior RCL parser for a suitable superset of L. 
model,205P011007,bq 
a
<term>
guide
</term>
which uses the
<term>

shared derivation forest

</term>
output by a prior
<term>
RCL parser

#1720
The nondeterministic parsing choices of the main parser for a language L are directed by a guide which uses theshared derivation forest output by a prior RCL parser for a suitable superset of L. 
tech,275P011007,bq 
derivation forest
</term>
output by a prior
<term>

RCL parser

</term>
for a suitable
<term>
superset of L.

#1727
The nondeterministic parsing choices of the main parser for a language L are directed by a guide which uses the shared derivation forest output by a priorRCL parser for a suitable superset of L. 
other,325P011007,bq 
<term>
RCL parser
</term>
for a suitable
<term>

superset of L. The results of a practical

</term><term>
evaluation
</term>
of this
<term>

#1732
The nondeterministic parsing choices of the main parser for a language L are directed by a guide which uses the shared derivation forest output by a prior RCL parser for a suitablesuperset of L. The results of a practical evaluation of this method on a wide coverage English grammar are given. 