other,5-1-P01-1007,bq scalable . The theoretical study of the <term> range concatenation grammar [ RCG ] formalism </term> has revealed many attractive properties
tech,22-1-P01-1007,bq attractive properties which may be used in <term> NLP </term> . In particular , <term> range concatenation
other,3-2-P01-1007,bq in <term> NLP </term> . In particular , <term> range concatenation languages [ RCL ] </term> can be parsed in <term> polynomial
other,13-2-P01-1007,bq languages [ RCL ] </term> can be parsed in <term> polynomial time </term> and many classical <term> grammatical
other,18-2-P01-1007,bq polynomial time </term> and many classical <term> grammatical formalisms </term> can be translated into equivalent
other,25-2-P01-1007,bq </term> can be translated into equivalent <term> RCGs </term> without increasing their <term> worst-case
other,29-2-P01-1007,bq RCGs </term> without increasing their <term> worst-case parsing time complexity </term> . For example , after <term> translation
tech,4-3-P01-1007,bq complexity </term> . For example , after <term> translation </term> into an equivalent <term> RCG </term>
other,8-3-P01-1007,bq translation </term> into an equivalent <term> RCG </term> , any <term> tree adjoining grammar
lr,11-3-P01-1007,bq an equivalent <term> RCG </term> , any <term> tree adjoining grammar </term> can be parsed in <term> O ( n6 ) time
other,18-3-P01-1007,bq adjoining grammar </term> can be parsed in <term> O ( n6 ) time </term> . In this paper , we study a <term>
tech,7-4-P01-1007,bq </term> . In this paper , we study a <term> parsing technique </term> whose purpose is to improve the practical
tech,18-4-P01-1007,bq improve the practical efficiency of <term> RCL parsers </term> . The <term> non-deterministic parsing
other,1-5-P01-1007,bq efficiency of <term> RCL parsers </term> . The <term> non-deterministic parsing choices </term> of the <term> main parser </term> for
tech,6-5-P01-1007,bq non-deterministic parsing choices </term> of the <term> main parser </term> for a <term> language L </term> are directed
other,10-5-P01-1007,bq of the <term> main parser </term> for a <term> language L </term> are directed by a <term> guide </term>
tech,16-5-P01-1007,bq language L </term> are directed by a <term> guide </term> which uses the <term> shared derivation
model,20-5-P01-1007,bq a <term> guide </term> which uses the <term> shared derivation forest </term> output by a prior <term> RCL parser
tech,27-5-P01-1007,bq derivation forest </term> output by a prior <term> RCL parser </term> for a suitable <term> superset of L.
other,32-5-P01-1007,bq <term> RCL parser </term> for a suitable <term> superset of L. The results of a practical </term><term> evaluation </term> of this <term>
skrij podrobnosti