Browse > Article

Edit Distance Problem for the Korean Alphabet with Phoneme Classification System  

Roh, Kang-Ho (서울대학교 전기컴퓨터공학부)
Park, Kun-Soo (서울대학교 전기컴퓨터공학부)
Cho, Hwan-Gue (부산대학교 정보컴퓨터공학부)
Chang, So-Won (서울대학교 국어국문학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.37, no.6, 2010 , pp. 323-329 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 with the phoneme classification system to improve the previous edit distance algorithm and present an algorithm for the edit distance problem for the Korean alphabet.
Keywords
edit distance; the korean alphabet; algorithm;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Jin-Ho Lee, Lectures on Korea phonology, Samkyungmunhwasa, 2005. (in korean)
2 Sung Mun Cho, Principles and Restrictions for the Phoneme Phenomenon of Korean Consonant, Hankookmunhwasa, 2000. (of korean)
3 Hirschberg, D. S.: A linear space algorithm for computing maximal common subsequences, Commun. ACM, vol.18, no.6, pp.341-343, 1975.   DOI   ScienceOn
4 http:/www.kocca.kr
5 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).
6 Navarro, G.: A guided tour to approximate string matching, ACM Computing Surveys, vol.33, no.1, pp.31-88, 2001.   DOI   ScienceOn
7 Young-Seon Kim, Research on Assimilation and Syllabification of Korean, 1999, Soul-si : Kukhak Charyowon. (in korean).
8 Ki-Moon Lee, Korean Phonology, Hakyensa, 2006. (in korean)
9 Wagner, R. A., Fischer, M. J.: The String-to-String Correction Problem, J. ACM, vol.21, no.1, pp.168-173, 1974.   DOI   ScienceOn
10 Kangho Roh, Jin Wook Kim, Eunsang Kim, Kunsoo Park, Hwan-Gue Cho, Edit Distance Problem for the Korean Alphabet, Journal of KIISE, 2010 (in korean).   과학기술학회마을
11 Gusfield, D.: Algorithms on strings, trees, and sequences : computer science and computational biology, Cambridge Univ. Press, January 2007.
12 M. Pucher, A. Turk, J. Ajmera, N. Fecher, Phonetic Distance Measures for Speech Recognition Vocabulary and Grammar Optimization, 3rd congress of the Alps Adria Acoustics Association, Graz, Austria, September 2007.
13 Gong, R., Chan, T. K.: Syllable Alignment: A Novel Model for Phonetic String Search, IEICE - Trans. Inf. Syst., E89-D(1), 2006, 332-339.   DOI   ScienceOn