A constrained finite-state morphotactics for Korean

Eunsok Ju, Chongwon Park, Minhaeng Lee, Kiyong Lee

Research output: Contribution to conferencePaperpeer-review

Abstract

In this paper, we propose a constrained finite-state model, named cfsm, for Korean morphotactics and attempt to show how it can successfully treat some major morphological problems in Korean. As a preliminary descriptive framework, this model adopts the Korean morphological system Komor by Lee (1999) to lay out some basic problems in Korean morphotactics and describe linear approaches to their possible solutions. This descriptive step is then followed by various testing steps executed by using Xerox's finite-state development tools, namely xfst for creating finite-state networks and lexc specifying natural language lexicons. With Komor's constraints represented in feature structures and appropriately implmented into xfst and by making Komor run on xfst, the proposed cfsm is expected to fully benefit from the descriptive groundwork of Komor and the finite-state processing power of xfst.

Original languageEnglish (US)
StatePublished - Dec 1 2005
Externally publishedYes
Event19th Pacific Asia Conference on Language, Information and Computation, PACLIC 19 - Taipei, Taiwan, Province of China
Duration: Dec 1 2005Dec 3 2005

Conference

Conference19th Pacific Asia Conference on Language, Information and Computation, PACLIC 19
CountryTaiwan, Province of China
CityTaipei
Period12/1/0512/3/05

Fingerprint Dive into the research topics of 'A constrained finite-state morphotactics for Korean'. Together they form a unique fingerprint.

Cite this