최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보과학회논문지. Journal of KIISE. 시스템 및 이론, v.37 no.6, 2010년, pp.323 - 329
노강호 (서울대학교 전기컴퓨터공학부) , 박근수 (서울대학교 전기컴퓨터공학부) , 조환규 (부산대학교 정보컴퓨터공학부) , 장소원 (서울대학교 국어국문학과)
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 alpha...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
Gusfield, D.: Algorithms on strings, trees, and sequences : computer science and computational biology, Cambridge Univ. Press, January 2007.
Wagner, R. A., Fischer, M. J.: The String-to-String Correction Problem, J. ACM, vol.21, no.1, pp.168-173, 1974.
Navarro, G.: A guided tour to approximate string matching, ACM Computing Surveys, vol.33, no.1, pp.31-88, 2001.
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).
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.
Gong, R., Chan, T. K.: Syllable Alignment: A Novel Model for Phonetic String Search, IEICE - Trans. Inf. Syst., E89-D(1), 2006, 332-339.
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).
Young-Seon Kim, Research on Assimilation and Syllabification of Korean, 1999, Soul-si : Kukhak Charyowon. (in korean).
Ki-Moon Lee, Korean Phonology, Hakyensa, 2006. (in korean)
Jin-Ho Lee, Lectures on Korea phonology, Samkyungmunhwasa, 2005. (in korean)
Sung Mun Cho, Principles and Restrictions for the Phoneme Phenomenon of Korean Consonant, Hankookmunhwasa, 2000. (of korean)
Hirschberg, D. S.: A linear space algorithm for computing maximal common subsequences, Commun. ACM, vol.18, no.6, pp.341-343, 1975.
http:/www.kocca.kr
※ AI-Helper는 부적절한 답변을 할 수 있습니다.