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