Implementing Korean Partial Parser based on Rules


The KIPS Transactions:PartB , Vol. 10, No. 4, pp. 389-396, Aug. 2003
10.3745/KIPSTB.2003.10.4.389,   PDF Download:

Abstract

In this paper, we present a Korean partial parser based on rules, which is used for running applications such as a grammar checker and a machine translation. Basically partial parsers construct one or more morphemes and/or words into one syntactical unit, but not complete syntactic trees, and accomplish some additional operations for syntactical parsing. The system described in this paper adopts a set of about 140 manually-written rules for partial parsing. Each rule consists of conditional statements and action statement that defines which one is head node and also describes an additional action to do if necessary. To observe that this approach can improve the efficiency of overall processing, we make simple experiments. The experimental results have shown that the average number of edges generated in processing without the partial parser is about 2 times more than that with the partial parser.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. G. Ju and K. J. Hun, "Implementing Korean Partial Parser based on Rules," The KIPS Transactions:PartB , vol. 10, no. 4, pp. 389-396, 2003. DOI: 10.3745/KIPSTB.2003.10.4.389.

[ACM Style]
Lee Gong Ju and Kim Jae Hun. 2003. Implementing Korean Partial Parser based on Rules. The KIPS Transactions:PartB , 10, 4, (2003), 389-396. DOI: 10.3745/KIPSTB.2003.10.4.389.