Á¤º¸°úÇÐȸ ³í¹®Áö C : ÄÄÇ»ÆÃÀÇ ½ÇÁ¦
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
Á¤±Ô ¾ð¾î¿Í ¹®¸Æ ÀÚÀ¯ ¾ð¾î »çÀÌÀÇ ÆíÁý °Å¸® °è»ê |
¿µ¹®Á¦¸ñ(English Title) |
Computing the Edit Distance between a Regular Language and a Context-free Language |
ÀúÀÚ(Author) |
°í»ó±â
ÇÑ¿ä¼·
Sang-Ki Ko
Yo-Sub Han
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 18 NO. 06 PP. 0464 ~ 0468 (2012. 06) |
Çѱ۳»¿ë (Korean Abstract) |
¿ì¸®´Â ÁÖ¾îÁø Á¤±Ô ¾ð¾î¿Í ¹®¸Æ ÀÚÀ¯ ¾ð¾î »çÀÌÀÇ ÆíÁý °Å¸®(edit distance)¸¦ °è»êÇÏ´Â ¾Ë°í¸®ÁòÀ» Á¦¾È ÇÑ´Ù. ÆíÁý °Å¸®´Â ÀϹÝÀûÀ¸·Î ÇϳªÀÇ ¹®ÀÚ¿À» ´Ù¸¥ ¹®ÀÚ¿·Î º¯È¯ÇÒ ¶§ ÇÊ¿äÇÑ ÃÖ¼ÒÇÑÀÇ ¿¬»êÀÇ °³¼ö¸¦ ÀǹÌÇÑ´Ù. ¹®ÀÚ¿ ´ÜÀ§°¡ ¾Æ´Ñ ¾ð¾î ´ÜÀ§¿¡¼ÀÇ ÆíÁý °Å¸®¸¦ °è»êÇÔÀ¸·Î½á, ÆÐÅÏ ¸ÅĪ(pattern matching)À̳ª ÆĽÌ(parsing)À» À§ÇØ ÁÖ¾îÁö´Â Á¤±Ô ¾ð¾î¿Í ¹®¸Æ ÀÚÀ¯ ¾ð¾î °£ÀÇ À¯»çµµ¸¦ È¿À²ÀûÀ¸·Î ÆľÇÇÒ ¼ö ÀÖ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
We propose an algorithm for computing the edit distance between a regular language and a context-free language. The edit distance is generally defined as the smallest number of operations required to transform a string into the other. By computing the edit distance between two languages instead of strings, we estimate the similarity between a regular language and a context-free language, which are often used for pattern matching or parsing.
|
Å°¿öµå(Keyword) |
Á¤±Ô ¾ð¾î
¹®¸Æ ÀÚÀ¯ ¾ð¾î
ÆíÁý °Å¸®
À¯ÇÑ ¿ÀÅ丶Ÿ
³»¸®´©¸§ ¿ÀÅ丶Ÿ
Regular Language
Context-free Language
Finite Automata
Pushdown Automata
Edit Distance
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|