• Language and Information
• /
• v.4 no.1
• /
• pp.97-109
• /
• 2000

Application systems of natural language processing such as machine translation system must deal with actual texts including the full range of linguistic phenomena. But it seems to be impossible that the existing grammar covers completely such actual texts because they include disruptive factors such as long sentences, unexpected sentence patterns and erroneous input to obstruct well-formed analysis of a sentence. In order to solve analysis failure due to the disruptive factors or incorrect selection of correct parse tree among forest parse trees, this paper proposes two-level computational grammar which consists of a constraint-based grammar and an error-tolerant grammar. The constraint-based computational grammar is the grammar that gives us the well-formed analysis of English texts. The error-tolerant computational grammar is the grammar that reconstructs a comprehensible whole sentence structure with partially successful parse trees within failed parsing results.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.96-104
• /
• 2007

We explore a computational algebraic approach to grammar via pregroups. We examine how the structures of Japanese causatives can be treated in the framework of a pregroup grammar. In our grammar, the dictionary assigns one or more syntactic types to each word and the grammar rules are used to infer types to strings of words. We developed a practical parser representing our pregroup grammar, which validates our analysis.

• Language and Information
• /
• v.20 no.1
• /
• pp.25-49
• /
• 2016

Honorific forms express the speaker's social attitude to others and also indicate the social ranks and level of intimacy of the participants in the discourse. In a cross-linguistic perspective of grammar engineering, modelling honorification has been regarded as a key strategy for improving language processing applications. Using the HPSG and MRS formalism, this article provides a multilingual grammar model of honorification. The present study incorporates the honorific information into the Meaning Representation System (MRS) via Individual Constraints (ICONS), and then conducts an evaluation to see if the model contributes to semantics-based language processing.

• Language and Information
• /
• v.15 no.2
• /
• pp.1-21
• /
• 2011

Of the coordination structures in Korean, the symmetric and asymmetric properties of verbal coordination have challenged both theoretical and computational approaches. This paper shows how a typed feature structure grammar, HPSG, together with the notions of 'type hierarchy' and 'constructions', can provide a robust basis for parsing (un)tensed verbal coordination as well as pseudo-coordination found in the language. We show that the analysis sketched here and computationally implemented in the existing resource grammar for Korean, Korean Resource Grammar (KRG), can yield proper syntactic structures as well as enriched semantic representations for real-time applications such as machine translation.

• Korean Journal of English Language and Linguistics
• /
• v.4 no.2
• /
• pp.175-194
• /
• 2004

This paper provides computational algorithms for English Questions, by which we can effectively handle and implement Yes-No Questions and Wh-Questions. Those algorithms will be developed in Categorial Grammar. In this paper, we will modify and revise Steedman＇s Combinatory Categorial Grammar (CCG) so that we can computationally implement Questions effectively, which will be called a CCG-like system. In this system, semantic interpretations of Questions will be calculated compositionally based on the functor-arguments relations of the constituents. In sum, this paper provides analyses of Questions in Categorial Grammar, by which we can effectively implement Questions in English.

• Language and Information
• /
• v.14 no.1
• /
• pp.1-24
• /
• 2010

The complexity of comparative constructions in each language has given challenges to both theoretical and computational analyses. This paper first identifies types of comparative constructions in Korean and discusses their main grammatical properties. It then builds a syntactic parser couched upon the typed feature structure grammar, HPSG and proposes a context-dependent interpretation for the comparison. To check the feasibility of the proposed analysis, we have implemented the grammar into the existing Korean Resource Grammar. The results show us that the grammar we have developed here is feasible enough to parse Korean comparative sentences and yield proper semantic representations though further development is needed for a finer model for contextual information.

• Korean Journal of English Language and Linguistics
• /
• v.1 no.4
• /
• pp.609-627
• /
• 2001

Pronouns are frequently used in English, and their resolution is important to capture meaning of sentences. This paper provides a computational implementation for pronoun readings in English, based on Chierchia's (1988) Binding Theory in Categorial Grammar. A CCG-like system is newly devised for implementing his ideas, where syntactic phenomena are represented by the functor-argument relations of categories. This relation triggers resolution algorithms, and reflexives and pronominals are resolved succinctly. In sum, this paper gives an efficient resolution algorithm for English pronouns within Categorial Grammar.

• English Language & Literature Teaching
• /
• v.10 no.1
• /
• pp.179-200
• /
• 2004

The purpose of this study is to investigate the adequacy of derivational approach and representational approach to syntactic theories in generative grammar. As the generative grammar is based on the derivational process of syntactic theories, it is suggested that derivational approach is more valid than representational approach. Move, Economy Principle, Local Economy and Label-free Phrase Structure in Minimalist framework support the preference of derivational approach to representational approach with the elimination of computational complexity, minimality, and label-free phrase structure. Syntactic structure is considered as the result of the interaction of the properties of lexical items containing probe and economy conditions constrained by bare output conditions. On the other hand, Pseudogapping in Lasnik(1999) is analyzed in terms of Object Shift, that is, overt raising to Spec of $Agr_o$ and the PF deletion of VP in representational approach. Hence, it is suggested that the combination of derivational and representational approaches to syntactic theories can be admitted in generative grammar.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.1
• /
• pp.49-55
• /
• 2018

In this paper, we propose a design and development of instructional cards to understand the grammar of coding, solving the problems and extending the computational thinking in the robot-driven environment. First, we designed the input/output module of the robot to process the coding grammar through the function analysis of the robot. And we designed the module of command card to learn coding grammar using color sensors. We have proven the validity of the designed instruction card by examining the experts to see if it is suitable for coding grammar learning. Designed robot and command card were developed with 28 cards and sensor robot. After applying the developed robot and command card to the elementary school students, the questionnaire showed that students grow the understanding and confidence of coding. In addition, students showed an increased need for programming learning.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.296-307
• /
• 2002

This paper provides computational algorithms for a Korean reflexive caki, for which both sentence-bound and long-distance readings are possible. Its analyses are based on Chierichia's theory in Categorial Grammar, and a CCG-like system is introduced for the implementation. In this system, we can get both readings of caki with the same resolution mechanisms, while the difference is where the reflexive is resolved. These algorithms enable us to account for the distributions and characteristics off long-distance reflexive caki with a more unified way.