• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.345-352
• /
• 2006

The practical English-Korean machine translation system should be able to translate long sentences quickly and accurately. The intra-sentence segmentation method has been proposed and contributed to speeding up the syntactic analysis. This paper proposes the syntactic category prediction method using decision trees for getting accurate parsing results. In parsing with segmentation, the segment is separately parsed and combined to generate the sentence structure. The syntactic category prediction would facilitate to select more accurate analysis structures after the partial parsing. Thus, we could improve the parsing accuracy by the prediction. We construct features for predicting syntactic categories from the parsed corpus of Wall Street Journal and generate decision trees. In the experiments, we show the performance comparisons with the predictions by human-built rules, trigram probability and neural networks. Also, we present how much the category prediction would contribute to improving the translation quality.

• Journal of the Korea Society for Simulation
• /
• v.19 no.1
• /
• pp.103-111
• /
• 2010

Syntactic analysis is an important step in natural language processing. However, we cannot use the syntactic analyzer in Korean for low performance and without robustness. We propose new robust, high speed and high performance Korean syntactic analyzer using CRFs. We treat a parsing problem as a labeling problem. We use a cascaded chunking for Korean parsing. We label syntactic information to each Eojeol at each step using CRFs. CRFs use part-of-speech tag and Eojeol syntactic tag features. Our experimental results using 10-fold cross validation show significant improvement in the robustness, speed and performance of long Korea sentences.

• Language and Information
• /
• v.10 no.2
• /
• pp.21-45
• /
• 2006

Connectivity effects have been central issues in dealing with specificational pseudoclefts. While syntactic approaches motivate their analysis in order to explain connectivity effects in terms of a connected clause, these accounts have numerous problems including a wide range of anti-connectivity effects that constitute crucial counterevidence. On the other hand, semantic accounts of connectivity effects treat BV and BT connectivity by independent interpretive mechanisms providing a more fundamental explanation for connectivity effects. Yet existing semantic accounts have limitations in explaining syntactic properties and syntactic connectivity effects in SPCs, and in accounting for BV anti-connectivity effects in English. Focusing on BV connectivity, this paper explores how the relevant (anti-)connectivity facts can be accounted for by an analysis that provides both an elaborate syntactic analysis of SPCs and a semantic mechanism for bound anaphora. Based on Yoo's (2005) non-deletion based, question-answer pair analysis of SPCs, this paper shows that a functional question analysis of a specificational subject, when combined with a theory of operator scope and a non-configurational condition on bound anaphora, can explain various BV (anti-)connectivity patterns in SPCs and related constructions.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.5
• /
• pp.55-65
• /
• 1997

In many cases, a dialogue system can't extract the correct analysis information of a user's spoken utterance, because of its own ungrammatical components. Therefore, in order to perform a correct before it performs the syntactic processing. In this paper, we use a real dialogue corpus and classify these ungrammatical errors as 4 categories : phonological, syntactic, semantic errors that consist of speech reparis and inversions, and propose an algorithm to detect and correct the errors. In short, this paper proposes a method to detect and correct the speech repairs and inversions that are classified as the phonological and syntactic errors to implement a robust dialogue system. And, through the test of real dialogue data, this paper shows an efficiency of the proposed algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.395-399
• /
• 2009

In this work, we describe the syntactic tag prediction system for Korean using the decision tree and CRFs. Generally they select features by their intuition. It depends on their prior knowledge. In this works, we combine features systematically using the decision tree. We also analyze errors and optimize features for the best performance. From the result of experiments, we can see that the proposed method is effective for the syntactic tag estimation and will be helpful for the syntactic analysis.

• Korean Journal of Cognitive Science
• /
• v.13 no.4
• /
• pp.42-42
• /
• 2002

An adverb has been generally defined as what modifies verbs or adjectives in Korean, but we can find that some adverbs can modify nouns. These kinds of adverbs lead a structural analysis complicated; therefore, they should be exceptionally processed by a syntactic parser. In this paper, we categorize a noun-modifying adverb and characterize that from a syntactic analysis standpoint. And also, we propose a method to handle noun-modifying adverbs for improving the accuracy of syntactic analysis. By using this proposed method, we can show that the parser increases it′s accuracy from 81.9 to 83.6% on testing corpus.

• Korean Journal of Cognitive Science
• /
• v.13 no.4
• /
• pp.43-53
• /
• 2002

An adverb has been generally defined as what modifies verbs or adjectives in Korean, but we can find that some adverbs can modify nouns. These kinds of adverbs lead a structural analysis complicated; therefore, they should be exceptionally processed by a syntactic parser. In this paper, we categorize a noun-modifying adverb and characterize that from a syntactic analysis standpoint. And also, we propose a method to handle noun-modifying adverbs for improving the accuracy of syntactic analysis. By using this proposed method, we can show that the parser increases it's accuracy from 81.9 to 83.6％ on testing corpus.

• Korean Journal of Cognitive Science
• /
• v.3 no.1
• /
• pp.41-60
• /
• 1991

Most of the PC users manipulate the computer by using a few commands which are familiar with them. However by using Hangul sentences instead of using DOS commands, the optimal commands can be generated and flexibility can be provided. For this purpose, the conversion method of the input sentence into DOS commands is studied by means of morphological analysis, syntactic analysis, semantic analysis, and conceptual analysis. Tabular parsing is used in morphological analysis. case grammar is used in syntactic and semantic analysis. Case grammar is used in syntactic and semantic analysis. The meaning of sentence is represeented by the semantic network, from which we can generate a sequence DOS commands.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.201-207
• /
• 2004

This paper is a study on the recognition of continuous speech and uses a method of speech recognition using syntactic analysis and one-stage DMS/DP. In order to perform the speech recognition, first of all, we make DMS model by section division algorithm and let continuous speech data be recognized through One-stage DMS/DP method using syntactic analysis. Besides the speech recognition experiments of proposed method, we experiment the conventional one-stage DP method under the equivalent environment of data and conditions. From the recognition experiments, it is shown that Ole-stage DMS/DP using syntactic analysis is superior to conventional method.

• Journal of Biomedical Engineering Research
• /
• v.12 no.4
• /
• pp.267-276
• /
• 1991

This paper describes syntactic pattern recognition algorithm for pattern recognition and diagnostic parameter extraction of ECG signal. ECG signal which is represented linguistic string is evaluated by pattern grammar and its interpreter-LALR(1) parser for pattern recognition. The proposed pattern grammar performs syntactic analysis and semantic evaluation simultaneously. The performance of proposed algorithm has been evaluated using CSE database.