| other,3-2-P01-1007,ak | 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 worst-case parsing time complexity. | |
| 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,10-5-P01-1007,ak | of the <term> main parser </term> for a <term> | language L | </term> are directed by a guide which uses | #1710 The non-deterministic 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 . | |
| lr,11-6-P01-1007,ak | practical evaluation of this method on a <term> | wide coverage English grammar | </term> are given . While <term> paraphrasing | #1747 The results of a practical evaluation of this method on awide coverage English grammar are given. | |
| tech,7-4-P01-1007,ak | </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,4-3-P01-1007,ak | 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. | |
| 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 | #1666 For example, after translation into an equivalent RCG, anytree 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 equivalentRCG, any tree adjoining grammar can be parsed in O(n6) time. | |
| other,25-2-P01-1007,ak | </term> can be translated into equivalent <term> | RCGs | </term> without increasing their <term> worst-case | #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 worst-case parsing time complexity. | |
| other,13-2-P01-1007,ak | languages [ RCL ] </term> can be parsed in <term> | polynomial time | </term> and many <term> classical 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 worst-case parsing time complexity. | |
| 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 inNLP. | |
| other,17-2-P01-1007,ak | <term> polynomial time </term> and many <term> | classical grammatical formalisms | </term> can be translated into equivalent | #1638 In particular, range concatenation languages [RCL] can be parsed in polynomial time and manyclassical grammatical formalisms can be translated into equivalent RCGs without increasing their worst-case parsing time complexity. | |
| tech,18-4-P01-1007,ak | improve the practical efficiency of <term> | RCL parsers | </term> . The <term> non-deterministic parsing | #1697 In this paper, we study a parsing technique whose purpose is to improve the practical efficiency ofRCL parsers. | |
| tech,27-5-P01-1007,ak | derivation forest </term> output by a prior <term> | RCL parser | </term> for a suitable <term> superset </term> | #1727 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 priorRCL parser for a suitable superset of L . | |
| 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 | #1721 The non-deterministic parsing choices of the main parser for a language L are directed by a guide which uses the sharedderivation forest output by a prior RCL parser for a suitable superset of L . | |
| 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 suitablesuperset of L . | |
| 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 | #1701 Thenon-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 . | |
| 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 | #1706 The non-deterministic 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,5-1-P01-1007,ak | 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. | |
| other,29-2-P01-1007,ak | 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. |
