| other,22-1-P01-1007,ak | 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 in NLP . | |
| tech,4-3-P01-1007,ak | complexity </term> . For example , after <term> | translation | </term> into an equivalent <term> RCG </term> | #1659 For example, after translation into an equivalent RCG, any tree adjoining grammar can be parsed in O(n6) time. | |
| other,8-3-P01-1007,ak | translation </term> into an equivalent <term> | RCG | </term> , any <term> tree adjoining grammar | #1663 For example, after translation into an equivalent RCG , any tree adjoining grammar can be parsed in O(n6) 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> | #1677 For example, after translation into an equivalent RCG, any tree adjoining grammar can be parsed in O(n6) time . | |
| other,32-5-P01-1007,ak | <term> RCL parser </term> for a suitable <term> | superset | </term> of L . The results of a practical | #1732 The non-deterministic 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 . |
