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

As pact of a long-ranged project that aims at establishing database-theoretic semantics as a model of computational semantics, this presentation focuses on the development of a syntactic component for processing strings of words or sentences to construct semantic data structures. For design arid modeling purposes, the present treatment will be restricted to the analysis of some problematic constructions of Korean involving semi-free word order, conjunction arid temporal anchoring, and adnominal modification and antecedent binding. The present work heavily relies on Hausser's (1999, 2000) SLIM theory for language that is based on surface compositionality, time-linearity arid two other conditions on natural language processing. Time-linear syntax for natural language has been shown to be conceptually simple and computationally efficient. The associated semantics is complex, however, because it must deal with situated language involving interactive multi-agents. Nevertheless, by processing input word strings in a time-linear mode, the syntax cart incrementally construct the necessary semantic structures for relevant queries and valid inferences. The fragment of Korean syntax will be implemented in Malaga, a C-type implementation language that was enriched for both programming and debugging purposes arid that was particluarly made suitable for implementing in Left-Associative Grammar. This presentation will show how the system of syntactic rules with constraining subrules processes Korean sentences in a step-by-step time-linear manner to incrementally construct semantic data structures that mainly specify relations with their argument, temporal, and binding structures.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.783-787
• /
• 2012

It is not easy to find out syntactic error in a spelling checker systems of Korean, because the spelling checker is generally to correct each phrase and it cannot check the errors of contextual ill-matched words. Spelling checker system tests errors based on a words. Disambiguation of lexical ambiguities is important in natural language processing. Its outputs is used in syntactic analysis. For accurate analysis of a sentence, syntactic analysis system must find out the ambiguity of morphemes in a word. In this paper, we suggest several rules to resolve the ambiguities of morphemes in a word. Using these methods, we can reduce many lexical ambiguities in Korean.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1193-1201
• /
• 1988

In this paper, we describe the syntactic and semantic parsing methods which use the case frames. The case structures based on obligatory cases of verbs. And, we use a small set of partial-garammar rules based on simple sentence to represent such case structures. Also, we enhance the efficiency by constructing independent procedure for particle classification and ambiguity resolution of major particle considering the importance of Japanese particle process in the generation. And we construct the generation table considering the combination possibility between the verbs and auxiliary verbs for processing the termination phrase. Therefore we can generate more natural translated sentence according to unique decision with information of syntactic analysis and simplify the generating process.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1418-1429
• /
• 2004

This paper presents GrammE, a grammar development environment for feature-based APSG. At the stage of a grammar development, analysis are be done by interpreting the grammar under development, given in a text format, it is relatively easy to diagnose the grammar. Once developed, the grammar is compiled, by using the embedded grammar compiler, into a parser program written in $C^{++}$. The parser program can be used in various types of natural language processing systems requiring syntactic analysis. GrammE is language-independent, and so far has been used for the development of Korean and Chinese grammars.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.5
• /
• pp.61-69
• /
• 2007

The subjective-type evaluation can estimate the high-recognition ability, but has the problem of the objectivity and reliability of the evaluation, and the difficulty of Korean language processing. To solve the problem, this paper designs and implements a subjective-type evaluation system using syntactic and case-role information. This system can reduce the time and endeavor for evaluation and provide the objectivity of the evaluation. The system results the 75% success rate to the instructor evaluation and gets the better precision and recall than the word extraction evaluation system. We expect that this system will become a basis of the research on the subjective-type evaluation.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.7
• /
• pp.291-298
• /
• 2022

In this paper, we present a method for dependency parsing with chunking in Korean. Dependency parsing is a task of determining a governor of every word in a sentence. In general, we used to determine the syntactic governor in Korean and should transform the syntactic structure into semantic structure for further processing like semantic analysis in natural language processing. There is a notorious problem to determine whether syntactic or semantic governor. For example, the syntactic governor of the word "먹고 (eat)" in the sentence "밥을 먹고 싶다 (would like to eat)" is "싶다 (would like to)", which is an auxiliary verb and therefore can not be a semantic governor. In order to mitigate this somewhat, we propose a Korean dependency parsing after chunking, which is a process of segmenting a sentence into constituents. A constituent is a word or a group of words that function as a single unit within a dependency structure and is called a chunk in this paper. Compared to traditional dependency parsing, there are some advantage of the proposed method: (1) The number of input units in parsing can be reduced and then the parsing speed could be faster. (2) The effectiveness of parsing can be improved by considering the relation between two head words in chunks. Through experiments for Sejong dependency corpus, we have shown that the USA and LAS of the proposed method are 86.48% and 84.56%, respectively and the number of input units is reduced by about 22%p.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.11
• /
• pp.27-40
• /
• 2020

In this paper, we investigate the correlation between the amount of English sentences that Korean English learners (L2ers) are exposed to and their sentence processing patterns by examining what Long Short-Term Memory (LSTM) language models (LMs) can learn about implicit syntactic relationship: that is, the filler-gap dependency. The filler-gap dependency refers to a relationship between a (wh-)filler, which is a wh-phrase like 'what' or 'who' overtly in clause-peripheral position, and its gap in clause-internal position, which is an invisible, empty syntactic position to be filled by the (wh-)filler for proper interpretation. Here to implement L2ers' English learning, we build LSTM LMs that in turn learn a subset of the known restrictions on the filler-gap dependency from English sentences in the L2 corpus that L2ers can potentially encounter in their English learning. Examining LSTM LMs' behaviors on controlled sentences designed with the filler-gap dependency, we show the characteristics of L2ers' sentence processing using the information-theoretic metric of surprisal that quantifies violations of the filler-gap dependency or wh-licensing interaction effects. Furthermore, comparing L2ers' LMs with native speakers' LM in light of processing the filler-gap dependency, we not only note that in their sentence processing both L2ers' LM and native speakers' LM can track abstract syntactic structures involved in the filler-gap dependency, but also show using linear mixed-effects regression models that there exist significant differences between them in processing such a dependency.

• Korean Journal of Cognitive Science
• /
• v.27 no.3
• /
• pp.469-499
• /
• 2016

The present study investigated the cognitive mechanism underlying online processing of Korean syntactic (for example, A bed/a clock belongs to/doesn't belong to the furniture "침대는/시계는 가구에 속한다/속하지 않는다") and lexical negation (for example, A tiger/a butterfly has/doesn't have a tail "호랑이는/나비는 꼬리가 있다/없다") using an ERP(Event-related potentials) technique and a truth-value verification task. 23 Korean native speakers were employed for the whole experiment and 15's brain responses (out of 23) were recorded for the ERP analysis. The behavioral results (i.e. verification task scores) show that there is universal pattern of the accuracy and response time for verification process: True-Affirmative (high accuracy and short latency) > False-Affirmative > False-Negated > True-Negated. However, the components (early N400 & P600) reflecting the immediate processing of a negation operator were observed only in lexical negation. Moreover, the ERP patterns reflecting an effect of truth value were not identical: N400 effect was observed in the true condition compared to the false condition in the lexically negated sentences, whereas Positivity effect (like early P600) was observed in the false condition compared to the true condition in the syntactically negated sentences. In conclusion, the form and location of negation operator varied by languages and negation types influences the strategy and pattern of online negation processing, however, the final representation resulting from different computational processing of negation appears to be language universal and is not directly affected by negation types.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.85-92
• /
• 2010

A shallow semantic parsing system analyzes the relationship that a syntactic constituent of the sentence has with a predicate. It identifies semantic arguments representing agent, patient, instrument, etc. of the predicate. In this study, we propose a two-phase shallow semantic parsing model which consists of the identification phase and the classification phase. We first find the boundary of semantic arguments from partial syntactic parsing results, and then assign appropriate semantic roles to the identified semantic arguments. By taking the sequential two-phase approach, we can alleviate the unbalanced class distribution problem, and select the features appropriate for each task. Experiments show the relative contribution of each phase on the test data.

• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.448-462
• /
• 2000

Coordinate constructions in natural language pose a number of difficulties to natural language processing units, due to the increased complexity of syntactic analysis, the syntactic ambiguity of the involved lexical items, and the apparent deletion of predicates in various places. In this paper, we address the syntactic characteristics of the coordinate constructions in Korean from the viewpoint of constructing a competence grammar, and present a version of combinatory categorial grammar for the analysis of coordinate constructions in Korean. We also show how to utilize a unified lexicon in the proposed grammar formalism in deriving the sentential semantics and associated information structures as well, in order to capture the discourse functions of coordinate constructions in Korean. The presented analysis conforms to the common wisdom that coordinate constructions are utilized in language not simply to reduce multiple sentences to a single sentence, but also to convey the information of contrast. Finally, we provide an analysis of sample corpora for the frequency of coordinate constructions in Korean and discuss some problematic cases.