| tech,13-3-H01-1041,bq | </term> include : ( i ) Robust efficient <term> | parsing | </term> of <term> Korean </term> ( a <term> verb | #452 The key features of the system include: (i) Robust efficientparsing of Korean (a verb final language with overt case markers, relatively free word order, and frequent omissions of arguments). |
| other,29-2-P01-1007,bq | without increasing their <term> worst-case | parsing | time complexity </term> . For example , after | #1651 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. |
| tech,7-4-P01-1007,bq | </term> . In this paper , we study a <term> | parsing | technique </term> whose purpose is to improve | #1686 In this paper, we study aparsing technique whose purpose is to improve the practical efficiency of RCL parsers. |
| other,1-5-P01-1007,bq | parsers </term> . The <term> non-deterministic | parsing | choices </term> of the <term> main parser </term> | #1702 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. |
| tech,6-6-J05-1003,bq | the <term> boosting method </term> to <term> | parsing | </term> the <term> Wall Street Journal treebank | #8792 We apply the boosting method toparsing the Wall Street Journal treebank. |
| other,23-9-J05-1003,bq | of the feature space </term> in the <term> | parsing | data </term> . Experiments show significant | #8884 The article also introduces a new algorithm for the boosting approach which takes advantage of the sparsity of the feature space in theparsing data. |
| tech,8-12-J05-1003,bq | this article are on <term> natural language | parsing | ( NLP ) </term> , the <term> approach </term> | #8946 Although the experiments in this article are on natural language parsing (NLP), the approach should be applicable to many other NLP problems which are naturally framed as ranking tasks, for example, speech recognition, machine translation, or natural language generation. |
| other,9-4-P80-1026,bq | In this paper , we outline a set of <term> | parsing | flexibilities </term> that such a system | #12747 In this paper, we outline a set ofparsing flexibilities that such a system should provide. |
| tech,9-1-C82-1054,bq | of modifications to the <term> left corner | parsing | algorithm </term> for <term> context-free grammars | #12800 This paper proposes a series of modifications to the left corner parsing algorithm for context-free grammars. |
| tech,1-1-P84-1047,bq | entity-oriented approach to restricted-domain | parsing | </term> is proposed . In this approach , | #13327 An entity-oriented approach to restricted-domain parsing is proposed. |
| tech,11-4-P84-1047,bq | recognition </term> and the use of <term> multiple | parsing | strategies </term> , and so is particularly | #13375 In addition, it facilitates fragmentary recognition and the use of multiple parsing strategies, and so is particularly useful for robust recognition of extra-grammatical input. |
| other,21-6-P84-1047,bq | entity-oriented parser </term> , some <term> | parsing | strategies </term> that use the <term> control | #13425 Representative samples from an entity-oriented language definition are presented, along with a control structure for an entity-oriented parser, someparsing strategies that use the control structure, and worked examples of parses. |
| other,8-7-P84-1047,bq | <term> control structure </term> and the <term> | parsing | strategies </term> is currently under <term> | #13447 A parser incorporating the control structure and theparsing strategies is currently under implementation. |
| tech,7-2-J86-1002,bq | </term> is done by strongly biasing <term> | parsing | </term> toward expected <term> meanings </term> | #14021 Error correction is done by strongly biasingparsing toward expected meanings unless clear evidence from the input shows the current sentence is not expected. |
| tech,15-1-C88-1066,bq | Restrictions ( CCRs ) </term> and describes two <term> | parsing | algorithms </term> that interpret it . <term> | #15255 This paper summarizes the formalism of Category Cooccurrence Restrictions (CCRs) and describes twoparsing algorithms that interpret it. |
| tech,0-1-C88-2132,bq | analysis of our <term> corpus </term> . <term> Chart | parsing | </term> is <term> directional </term> in the | #15498 Chart parsing is directional in the sense that it works from the starting point (usually the beginning of the sentence) extending its activity usually in a rightward manner. |
| tech,28-3-A92-1026,bq | technique called <term> terminal substring | parsing | </term> . For <term> pragmatics processing </term> | #17486 We describe three techniques for making syntactic analysis more robust---an agenda-based scheduling parser, a recovery technique for failed parses, and a new technique called terminal substring parsing. |
| tech,6-1-A92-1027,bq | algorithm for <term> chart-based phrase structure | parsing | </term> of <term> natural language </term> that | #17552 We present an efficient algorithm for chart-based phrase structure parsing of natural language that is tailored to the problem of extracting specific information from unrestricted texts where many of the words are unknown and much of the text is irrelevant to the task. |
| tech,8-1-C92-2068,bq | expensive part of <term> unification-based grammar | parsing | </term> . We focus on one speed-up element | #17956 Graph unification remains the most expensive part of unification-based grammar parsing. |
| tech,1-2-C92-3165,bq | understanding </term> . The <term> generalized LR | parsing | </term> is enhanced in this approach . <term> | #18152 The generalized LR parsing is enhanced in this approach. |
