Edit Distance Problem for the Korean Alphabet
Kangho Roh, Jinwook Kim, Eun-Sang Kim, Kun-Soo Park, Hwan-Gue Cho · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2010
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.