| measure(ment),5-6-P01-1007,bq | The results of a practical </term><term> evaluation </term> of this <term> method </term> on a <term> wide coverage English grammar </term> are given . | #1740 The results of a practicalevaluation of this method on a wide coverage English grammar are given. |
| other,18-2-P01-1007,bq | In particular , <term> range concatenation languages [ RCL ] </term> can be parsed in <term> polynomial time </term> and many classical <term> grammatical formalisms </term> can be translated into equivalent <term> RCGs </term> without increasing their <term> worst-case parsing time complexity </term> . | #1639 In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classicalgrammatical formalisms can be translated into equivalent RCGs without increasing their worst-case parsing time complexity. |
| tech,16-5-P01-1007,bq | The <term> non-deterministic parsing choices </term> of the <term> main parser </term> for a <term> language L </term> are directed by a <term> guide </term> which uses the <term> shared derivation forest </term> output by a prior <term> RCL parser </term> for a suitable <term> superset of L. | #1716 The non-deterministic parsing choices of the main parser for a language L are directed by aguide which uses the shared derivation forest output by a prior RCL parser for a suitable superset of L. |
| other,10-5-P01-1007,bq | The <term> non-deterministic parsing choices </term> of the <term> main parser </term> for a <term> language L </term> are directed by a <term> guide </term> which uses the <term> shared derivation forest </term> output by a prior <term> RCL parser </term> for a suitable <term> superset of L. | #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. |
| tech,6-5-P01-1007,bq | The <term> non-deterministic parsing choices </term> of the <term> main parser </term> for a <term> language L </term> are directed by a <term> guide </term> which uses the <term> shared derivation forest </term> output by a prior <term> RCL parser </term> for a suitable <term> superset of L. | #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. |
| tech,8-6-P01-1007,bq | The results of a practical </term><term> evaluation </term> of this <term> method </term> on a <term> wide coverage English grammar </term> are given . | #1743 The results of a practical evaluation of thismethod on a wide coverage English grammar are given. |
| tech,22-1-P01-1007,bq | The theoretical study of the <term> range concatenation grammar [ RCG ] formalism </term> has revealed many attractive properties which may be used in <term> NLP </term> . | #1619 The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used inNLP. |
| other,1-5-P01-1007,bq | The <term> non-deterministic parsing choices </term> of the <term> main parser </term> for a <term> language L </term> are directed by a <term> guide </term> which uses the <term> shared derivation forest </term> output by a prior <term> RCL parser </term> for a suitable <term> superset of L. | #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. |
| other,18-3-P01-1007,bq | For example , after <term> translation </term> into an equivalent <term> RCG </term> , any <term> tree adjoining grammar </term> can be parsed in <term> O ( n6 ) time </term> . | #1673 For example, after translation into an equivalent RCG, any tree adjoining grammar can be parsed inO ( n6 ) time. |
| tech,7-4-P01-1007,bq | In this paper , we study a <term> parsing technique </term> whose purpose is to improve the practical efficiency of <term> RCL parsers </term> . | #1686 In this paper, we study aparsing technique whose purpose is to improve the practical efficiency of RCL parsers. |
| other,13-2-P01-1007,bq | In particular , <term> range concatenation languages [ RCL ] </term> can be parsed in <term> polynomial time </term> and many classical <term> grammatical formalisms </term> can be translated into equivalent <term> RCGs </term> without increasing their <term> worst-case parsing time complexity </term> . | #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,5-1-P01-1007,bq | The theoretical study of the <term> range concatenation grammar [ RCG ] formalism </term> has revealed many attractive properties which may be used in <term> NLP </term> . | #1602 The theoretical study of therange concatenation grammar [ RCG ] formalism has revealed many attractive properties which may be used in NLP. |
| other,3-2-P01-1007,bq | In particular , <term> range concatenation languages [ RCL ] </term> can be parsed in <term> polynomial time </term> and many classical <term> grammatical formalisms </term> can be translated into equivalent <term> RCGs </term> without increasing their <term> worst-case parsing time complexity </term> . | #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,8-3-P01-1007,bq | For example , after <term> translation </term> into an equivalent <term> RCG </term> , any <term> tree adjoining grammar </term> can be parsed in <term> O ( n6 ) time </term> . | #1663 For example, after translation into an equivalentRCG, any tree adjoining grammar can be parsed in O(n6) time. |
| other,25-2-P01-1007,bq | In particular , <term> range concatenation languages [ RCL ] </term> can be parsed in <term> polynomial time </term> and many classical <term> grammatical formalisms </term> can be translated into equivalent <term> RCGs </term> without increasing their <term> worst-case parsing time complexity </term> . | #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. |
| tech,27-5-P01-1007,bq | The <term> non-deterministic parsing choices </term> of the <term> main parser </term> for a <term> language L </term> are directed by a <term> guide </term> which uses the <term> shared derivation forest </term> output by a prior <term> RCL parser </term> for a suitable <term> superset of L. | #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. |
| tech,18-4-P01-1007,bq | In this paper , we study a <term> parsing technique </term> whose purpose is to improve the practical efficiency of <term> RCL parsers </term> . | #1697 In this paper, we study a parsing technique whose purpose is to improve the practical efficiency ofRCL parsers. |
| model,20-5-P01-1007,bq | The <term> non-deterministic parsing choices </term> of the <term> main parser </term> for a <term> language L </term> are directed by a <term> guide </term> which uses the <term> shared derivation forest </term> output by a prior <term> RCL parser </term> for a suitable <term> superset of L. | #1720 The non-deterministic parsing choices of the main parser for a language L are directed by a guide which uses theshared derivation forest output by a prior RCL parser for a suitable superset of L. |
| other,32-5-P01-1007,bq | The <term> non-deterministic parsing choices </term> of the <term> main parser </term> for a <term> language L </term> are directed by a <term> guide </term> which uses the <term> shared derivation forest </term> output by a prior <term> RCL parser </term> for a suitable <term> superset of L. The results of a practical </term><term> evaluation </term> of this <term> method </term> on a <term> wide coverage English grammar </term> are given . | #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. The results of a practical evaluation of this method on a wide coverage English grammar are given. |
| tech,4-3-P01-1007,bq | For example , after <term> translation </term> into an equivalent <term> RCG </term> , any <term> tree adjoining grammar </term> can be parsed in <term> O ( n6 ) time </term> . | #1659 For example, aftertranslation into an equivalent RCG, any tree adjoining grammar can be parsed in O(n6) time. |
