| tech,13-3-H01-1041,ak | </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,ak | 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,ak | </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. | |
| tech,1-5-P01-1007,ak | 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-7-H05-1064,ak | Although our experiments are focused on <term> | parsing | </term> , the techniques described generalize | #5566 Although our experiments are focused onparsing, the techniques described generalize naturally to NLP structures other than parse trees. | |
| tech,9-2-I05-2044,ak | dependencies </term> is essential for <term> dependency | parsing | </term> of <term> sentences </term> with two | #6641 The ambiguity resolution of right-side dependencies is essential for dependency parsing of sentences with two or more verbs. | |
| tech,21-5-I05-6010,ak | framework of <term> SILVA </term> , a <term> | parsing | and extraction tool </term> for <term> German | #7921 The information gained from corpus research and the analyses that are proposed are realized in the framework of SILVA, aparsing and extraction tool for German text corpora. | |
| other,23-9-J05-1003,ak | the <term> feature space </term> in the <term> | parsing | data </term> . Experiments show significant | #8249 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,ak | this article are on <term> natural language | parsing | ( NLP ) </term> , the approach should be | #8311 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. | |
| interplay between <term> smoothing </term> and | parsing | results . The applicability of many current | #9013 In addition to the high accuracy of the model, the use of smoothing in an unlexicalized parser allows us to better examine the interplay between smoothing and parsing results. | ||
| tech,30-3-P05-1053,ak | while additional information from <term> full | parsing | </term> gives limited further enhancement | #9324 Our study illustrates that the base phrase chunking information is very effective for relation extraction and contributes to most of the performance improvement from syntactic aspect while additional information from full parsing gives limited further enhancement. | |
| tech,1-3-P81-1032,ak | and ungrammatical input </term> . A <term> | parsing | algorithm </term> is presented that integrates | #13798 Aparsing algorithm is presented that integrates several different parsing strategies, with case-frame instantiation dominating. | |
| tech,9-3-P81-1032,ak | that integrates several different <term> | parsing | strategies </term> , with <term> case-frame | #13806 A parsing algorithm is presented that integrates several differentparsing strategies, with case-frame instantiation dominating. | |
| tech,3-4-P81-1032,ak | instantiation </term> dominating . Each of these <term> | parsing | strategies </term> exploits different types | #13817 Each of theseparsing strategies exploits different types of knowledge; and their combination provides a strong framework in which to process conjunctions, fragmentary input, and ungrammatical structures, as well as less exotic, grammatically correct input. | |
| tech,12-5-P81-1033,ak | construction-specific approach to <term> flexible | parsing | </term> , with specialized <term> parsing techniques | #14001 Focused interaction of this kind is facilitated by a construction-specific approach to flexible parsing, with specialized parsing techniques for each type of construction, and specialized ambiguity representations for each type of ambiguity that a particular construction can give rise to. | |
| tech,17-5-P81-1033,ak | flexible parsing </term> , with specialized <term> | parsing | techniques </term> for each type of <term> | #14005 Focused interaction of this kind is facilitated by a construction-specific approach to flexible parsing, with specializedparsing techniques for each type of construction, and specialized ambiguity representations for each type of ambiguity that a particular construction can give rise to. | |
| tech,9-1-C82-1054,ak | of modifications to the <term> left corner | parsing | algorithm </term> for <term> context-free grammars | #14089 This paper proposes a series of modifications to the left corner parsing algorithm for context-free grammars. | |
| tech,14-4-P83-1003,ak | a simple extension to an existing <term> | parsing | method </term> for <term> GPSG </term> . <term> | #14709 The extension is shown to be parseable by a simple extension to an existingparsing method for GPSG. | |
| tech,5-1-P83-1021,ak | exploring the relationship between <term> | parsing | </term> and <term> deduction </term> , a new | #14795 By exploring the relationship betweenparsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is the basis of the Earley Deduction proof procedure for definite clauses. | |
| tech,16-1-P83-1021,ak | new and more general view of <term> chart | parsing | </term> is obtained , which encompasses <term> | #14807 By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is the basis of the Earley Deduction proof procedure for definite clauses. |
