Browse > Article

Edit Distance Problem for the Korean Alphabet  

Roh, Kang-Ho (서울대학교 전기컴퓨터공학부)
Kim, Jin-Wook (인하대학교 컴퓨터정보공학부)
Kim, Eun-Sang (서울대학교 전기컴퓨터공학부)
Park, Kun-Soo (서울대학교 전기컴퓨터공학부)
Cho, Hwan-Gue (부산대학교 정보.컴퓨터공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.37, no.2, 2010 , pp. 103-109 More about this Journal
Abstract
The edit distance problem is finding the minimum number of edit operations to transform a string into another one. It is one of the important problems in algorithm research and there are some algorithms that compute an optimal edit distance for the one-dimensional languages such as the English alphabet. However, there are a few researches to find the edit distance for the more complicated language such as the Korean or Chinese alphabet. In this paper, we define the measure of the edit distance for the Korean alphabet and present an algorithm for the edit distance problem for the Korean alphabet.
Keywords
edit distance; the korean alphabet; algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Gusfield, D.: Algorithms on strings, trees, and sequences : computer science and computational biology, Cambridge Univ. Press, January 2007.
2 Wagner, R. A., Fischer, M. J.: The String-to- String Correction Problem, J. ACM, 21(1), pp.168-173, 1974.   DOI   ScienceOn
3 Navarro, G.: A guided tour to approximate string matching, ACM Computing Surveys, 33(1), pp.31-88, 2001.   DOI   ScienceOn
4 Sowon Chang, Seong-kyu Kim, Seung-chul Jung, This slip of the tongue that slip of the pen: official documents, Ministry of Culture and Tourism, 2000 (in korean).
5 Gong, R., Chan, T. K.: Syllable Alignment: A Novel Model for Phonetic String Search, IEICE -Trans. Inf. Syst., E89-D(1), pp.332-339, 2006.   DOI   ScienceOn
6 Hirschberg, D. S.: A linear space algorithm for computing maximal common subsequences, Commun. ACM, 18(6), pp.341-343, 1975.   DOI   ScienceOn