| 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 | #1666 For example, after translation into an equivalent RCG, anytree adjoining grammar can be parsed in O(n6) time. |
| model,11-6-P01-1007,bq | </term> of this <term> method </term> on a <term> | wide coverage English grammar | </term> are given . While <term> paraphrasing | #1746 The results of a practical evaluation of this method on awide coverage English grammar are given. |
| other,29-2-P01-1007,bq | RCGs </term> without increasing their <term> | worst-case 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 theirworst-case parsing time complexity. |
