Parsing the voyager domain using pearl
HLT '91 Proceedings of the workshop on Speech and Natural Language
Procedure for quantitatively comparing the syntactic coverage of English grammars
HLT '91 Proceedings of the workshop on Speech and Natural Language
The computational analysis of the syntax and interpretation of free word order in Turkish
The computational analysis of the syntax and interpretation of free word order in Turkish
Parsing with Context-Free Grammars and Word Statistics
Parsing with Context-Free Grammars and Word Statistics
Structural ambiguity and lexical relations
Computational Linguistics - Special issue on using large corpora: I
A new statistical parser based on bigram lexical dependencies
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Efficiency, robustness and accuracy in Picky chart parsing
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
The Korean Combinatory Categorial Grammar (KCCG) formalism can uniformly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and across clause boundaries, i.e., long distance scrambling. In this paper, incremental parsing technique of a morpheme graph is developed using the KCCG. We present techniques for choosing the most plausible parse tree using lexical information such as category merge probability, head-head co-occurrence heuristic, and the heuristic based on the coverage of subtrees. The performance results for various models for choosing the most plausible parse tree are compared.