DOI: 10.3115/992730.992793 Conference: COLING 2000, 18th International Conference on Computational Linguistics, Proceedings of the Conference, 2 Volumes, July 31 - August 4, 2000, Universität des Saarlandes, Saarbrücken, Germany
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. 1 Introduction Korean is a non-configurational, postpositional, agglutinative language. Postpositions, such as noun-endings, verb-endings, and prefinal verbendings, are morphemes that determine the functional role of NPs (noun phrases) and VPs (verb phrases) in sentences and also transform VPs into NPs or APs (adjective phrases). Since a sequence of...
[Show abstract][Hide abstract] ABSTRACT: Abstract In this paper we,propose,a new,approach, to Categorial Grammars,based,on Combinatory,Logic to solve some syntactic and,semantic,problems,in the Korean language processing. We handle particularly the problems of cases, free word,order structure and coordination by developing,a formalism of the extended,Categorial Grammar,that was originally introduced by J.-P. Desclés, and I. Biskri. We call this extended,Categorial Grammar, “Applicative and Combinatory Categorial Grammar,(ACCG)” . T he ACCG formalism allows us to analyze syntactically and semantically the cases in Korean, in particular the linguistic phenomenon,of double,cases. In spite of the ,importance of the cases in the processing of the Korean language, this topic has not been,well studied in view,to its automatic processing and there are still many ,difficulties in parsing Korean texts. This article shows ,some ,robust solutions for the analysis of the free word,order structure and of the coordination by introducing combinators, such as B, C*, Φ, of Combinatory,Logic developed,by H.-B. Curry and,R. Feys. 1. Introduction to Categorical Grammars, Categorial Grammars,and,their extensions,are deeply
Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, May 15-17, 2008, Coconut Grove, Florida, USA; 01/2008
Note: This list is based on the publications in our database and might not be exhaustive.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.