Skip to main content
Log in

A computational model of Korean morphological analysis: A prediction-based approach

  • Published:
Journal of East Asian Linguistics Aims and scope Submit manuscript

Abstract

In this paper, we present an efficient morphological analysis model for Korean which produces all the feasible sequences of morphemes of a given input word. This model is deterministic in applying spelling rules and works with little computational redundancy in processing complex and ambiguous words. The computational efficiency is made possible by three new techniques: first, a method for interpreting and compiling spelling rules; second, predictive rule application which restricts the spelling rules suitable for the input word; third, morphological chart parsing which enables the analyzer to avoid recomputing analyzed substrings in case the input word is morphologically ambiguous. Our model has been tested with words selected from a corpus of Korean elementary textbooks. Experimental results show that our model guarantees fast and reliable processing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Ahn, Sang-Chel (1985) The Interplay of Phonology and Morphology in Korean, PhD dissertation, University of Illinois, Urbana-Champaign.

    Google Scholar 

  • Aho, Alfred V. and Jeffrey D. Ullman (1972) The Theory of Parsing, Translation, and Compiling, Prentice-Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • Antworth, Evan L. (1990) PC-KIMMO: A Two-Level Processor for Morphological Analysis, Summer Institute of Linguistics, Dallas.

    Google Scholar 

  • Barton, G. Edwa, Robert C. Berwick and Eric Sven Ristad (1987) Computational Complexity and Natural Language, MIT Press, Cambridge, pp. 115–186.

    Google Scholar 

  • Finin, T. (1980) The Semantic Interpretation of Compound Nominals, PhD dissertation, University of Illinois, Urbana-Champaign.

    Google Scholar 

  • Holub, A. L. (1990) Compiler Design in C, Prentice-Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • Kang, Seung-Shik and Yung-Taek Kim (1991) “Sacen Cengboey Kipanhan Hyoyulcecin Hankuke Hyengthayso Punsekkiuy Selkyey Mich Kuhyen [A Design and Implementation of Efficient Korean Morphological Analyzer Based on Dictionary Information],” Proceedings of the 18th Conference of Korean Information Science Society, Hongik University, 1991, pp. 529–532.

  • Kaplan, Ronald M. and Martin Kay (1994) “Regular Models of Phonological Rule Systems,” Computational Linguistics 20–3, 331–378.

    Google Scholar 

  • Karttunen, Lauri (1983) “KIMMO: A General Morphological Processor,” Texas Linguistic Forum 22, 165–186.

    Google Scholar 

  • Karttunen, Lauri and Kent Wittenburg (1983) “A Two-Level Morphological Analysis of English,” Texas Linguistic Forum 22, 217–228.

    Google Scholar 

  • Kim, Deok-Bong and Key-Sun Choi (1993) “DDAG: Hyoyulcecin Hankuke Hyengthayso Haysek Pangpep [DDAG: An Efficient Method for Morphological Analysis of Korean],” Proceedings of the 5th Conference of Hangul and Korean Information Processing, SERI, 1993, pp. 341–353.

  • Kim, Deok-Bong, Sung-Jin Lee, Key-Sun Choi and Gil-Chang Kim (1994) “A Two-Level Morphological Analysis of Korean,” Proceedings of the 15th International Conference on Computational Linguistics, Kyoto, Japan, 1994, pp. 535–539.

  • Kim, Seong-Yong (1987) Tabular Parsing Pangpepkwa Cepsok Cengpolul Iyonghan Hankuke Hyengthayso Punsekki [A Morphological Analyzer for Korean Language with Tabular Parsing Method and Connectivity Information], MS thesis, Korean Advanced Institute of Science and Technology.

  • Knuth, Dona E. (1973) The Art of Computer Programming, Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  • Koskenniemi, Kimmo (1983) Two-Level Morphology: A General Computational Model for Word-Form Recognition and Production, PhD dissertation, University of Helsinki, Helsinki.

    Google Scholar 

  • Kwon, Hyuk-Chul and Young-Soog Chae (1991) “A Dictionary-Based Morphological Analysis,” Proceedings of Natural Language Processing Pacific Rim Symposium, Singapore, 1991, pp. 178–185.

  • Lee, Hee-Sung and Byung-Hee Ahn (1991) Hangul Macchumpep Kanguy [Lecture on Korean Orthography], Shin-Koo Press, Seoul.

    Book  CAS  PubMed  Google Scholar 

  • Lee, Sung-Jin (1992) Two-Level Hankuke Hyengthayso Haysek [A Two-Level Morphological Analysis of Korean], MS thesis, Korean Advanced Institute of Science and Technology.

  • Ritchie, Graeme D., Graham J. Russell, Alan W. Black and Stephen G. Pulman (1992) Computational Morphology: Practical Mechanisms for the English Lexicon, MIT Press, Cambridge.

    Google Scholar 

  • Sproat, Richard (1992) Morphology and Computation, MIT Press, Cambridge.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, DB., Choi, KS. & Lee, KH. A computational model of Korean morphological analysis: A prediction-based approach. J East Asian Linguis 5, 183–215 (1996). https://doi.org/10.1007/BF00215073

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00215073

Keywords

Navigation