• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1705-1712
• /
• 2009

Recently, most Korean syntactic analysis systems use Dependency Grammar, because it is quite good to analysis of Korean language structures. But Dependency Grammar makes many ambiguities during syntax analysis of Korean. We implement a system which decreases many ambiguities in syntax analysis. To decrease ambiguities we suggest several methods. First, we use about 200 dependency rules, second, we suggest a new segmentation method and third, one predicate can not have more than one subject or object. Using these methods, we can reduce many ambiguities in Korean syntactic analysis.

• Journal of Advanced Marine Engineering and Technology
• /
• v.37 no.7
• /
• pp.760-770
• /
• 2013

Detecting grammatical errors from a text is a long-history application. In this paper, we compare the performance of two grammatical error detection techniques, which are implemented as a sub-module of an automated English scoring system. One is to use a full syntactic parser, which has not only grammatical rules but also extra-grammatical rules in order to detect syntactic errors while paring. The other one is to use a finite state machine which can identify an error covering a small range of an input. In order to compare the two approaches, grammatical errors are divided into three parts; the first one is grammatical error that can be handled by both approaches, and the second one is errors that can be handled by only a full parser, and the last one is errors that can be done only in a finite state machine. By doing this, we can figure out the strength and the weakness of each approach. The evaluation results show that a full parsing approach can detect more errors than a finite state machine can, while the accuracy of the former is lower than that of the latter. We can conclude that a full parser is suitable for detecting grammatical errors with a long distance dependency, whereas a finite state machine works well on sentences with multiple grammatical errors.

• Lingua Humanitatis
• /
• v.8
• /
• pp.369-387
• /
• 2006

Which syntactic function should we assign to the 'ga-type' constituent which occurs in the morphological passive constructions in Korean, [N0-neun N1-i Vpass-ending]? This problem is very important in two respects. First, a small change of status of the particle 'i/ga' can exert an overall influence on the Korean grammar. Second, the particle '-i/ga' cannot guarantee that 'ga-type' constituents are subject of the sentence, so that the concept of syntactic category should be distinguished from that of syntactic function. This paper claims that the analysis of sentence has long been focused on the structure of proposition, namely the argument structure and that the direction of analysis should be turned to the 'person structure' which can be revealed on the pragmatic level. On the basis of this, this paper suggests that the specific type of the morphological passive constructions in Korean, [N0-neun N1-i Vpass-ending] should be analysed in line with the psych-verb constructions and that the modal meaning 'potential' of the passive constructions is correlated with sentence pattern and 'person structure'.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.18 no.5
• /
• pp.15-21
• /
• 1981

This paper deals with the syntactic analysis algorithms of Korean sentence and system for machine translation. The parts of speech and constituients are syntactically analized at unified view-points and then an effective classification algorithm is proposed. The constituients which are applied an inverse movement transformation algorithm are processed with the concept of attribute. Syntactic analysis system is constructed to generate parsing table including the deep structure of sentence by lexicon proper to the combinational property of Korean and breadth-first searching method. The results obtained from the system program are shown as the parsing table of source sentences.

• 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.

• Language and Information
• /
• v.19 no.1
• /
• pp.37-57
• /
• 2015

This paper is primarily intended to provide a new insight on which the structural properties of As-Parenthetical constructions shown by Potts (2002) might be regarded as cross-linguistically common one. As a first attempt, it introduces the characteristics of Korean As-Parenthetical by carefully investigating them through the data, focusing on the similarities or differences between two languages with a constructional theoretical perspective. The paper here provides three properties of Korean as-clauses in the morphological and syntactic aspects. First, the morpheme 'as' in English as-clause would be realized as three different morphemes as a bound one. Korean as-clauses can be introduced by three different morphemes, '-tusi, -chelem, -taylo' and unlike that in English as-clauses, they behave as bound morphemes which do not stand alone. Even though they are attached into different morpho-syntactic stems, they do not make any meaning change only under this clause. Secondly, two syntactic types of as-clauses can also be found in Korean, similarly to those of English: CP-As type and Predicate-As type, depending on which types of gap they involve in. English has one more subtype of Predicate-As type (called inverted Predicate-As clause), while Korean does not show this subtype. Thirdly, the various mismatches attributed by the gap and the antecedent come from the constructional restrictions of as-clauses in Korean. In addition, the paper attempts to display various ambiguities from the as-clauses through disjoint references or negative sentences in As-Parenthetical constructions.

• 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.

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

Compound verbs in Korean show properties of both syntactic phrases and lexical items. Earlier studies of compound verbs have either assumed two homonymous types, i.e. one as a syntactic phrase and the other as a lexical item, or posited some sort of transformation from a syntactic phrase into a lexical item. In this paper, I show empirical and conceptual problems for earlier studies, and present an alternative account in terms of Talmy's (2000) theory of lexicalization. Unlike Talmy who proposed [Path] conflation into [MOVE] for Korean, I suggest several types of [Co-Event] conflation; e.g. [$_{Co-Event}$ Manner] conflation as in kwul-e-kata 'to go by rolling', [$_{Co-Event}$ Concomitance] conflation as in ttal-a-kata 'to follow', [$_{Co-Event}$ Concurrent Result] conflation as in cap-a-kata 'to catch somebody and go', etc. The present proposal not only places Korean compound verbs in a broader picture of cross-linguistic generalizations, but, when viewed from Jackendoff's (1997) productive vs. semi-productive morphology, provides a natural account for classifying the compounds that allow -se intervention from those that do not.

• 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.

• Journal of Information Technology Services
• /
• v.8 no.1
• /
• pp.203-215
• /
• 2009

This paper illustrates the application of co-occurrence theory to generate lightweight ontologies semi-automatically. The proposed model includes three steps of a (Semi-) Automatic creation of Ontology; (they are conceptually named as) the Syntactic-based Ontology, the Semantic-based Ontology and the Ontology Refinement. Each of these three steps are designed to interactively work together, so as to generate Lightweight Ontologies. The Syntactic-based Ontology step includes generating Association words using co-occurrence in web documents. The Semantic-based Ontology step includes the Alignment large Association words with small Ontology, through the process of semantic relations by contextual terms. Finally, the Ontology Refinement step includes the domain expert to refine the lightweight Ontologies. We also conducted a case study to generate lightweight ontologies in specific domains(news domain). In this paper, we found two directions including (1) employment co-occurrence theory to generate Syntactic-based Ontology automatically and (2) Alignment large Association words with small Ontology to generate lightweight ontologies semi-automatically. So far as the design and the generation of big Ontology is concerned, the proposed research will offer useful implications to the researchers and practitioners so as to improve the research level to the commercial use.