Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
Current Result Document : 1 / 2
ÇѱÛÁ¦¸ñ(Korean Title) |
°³³ä ±¸Á¶ÀÇ È¿À²ÀûÀΠǥÇöÀ» À§ÇÑ °³³ä Æ®¸® |
¿µ¹®Á¦¸ñ(English Title) |
Conceptual Trees for an Efficient Representation of Conceptual Structures |
ÀúÀÚ(Author) |
¹è¿ìÁ¤
¹ÚÀÎö
ÀÌ¿ë¼®
Woo-Jeong Bae
In-Cheol Park
Yong-Seok Lee
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 26 NO. 06 PP. 0822 ~ 0832 (1999. 06) |
Çѱ۳»¿ë (Korean Abstract) |
°³³ä ±×·¡ÇÁ´Â °³³ä ±¸Á¶(conceptual structures)¸¦ ±×·¡ÇÁ·Î Ç¥ÇöÇÑ ³í¸® ½Ã½ºÅÛÀ¸·Î ÀÚ¿¬¾î 󸮿¡ ÀûÇÕÇÑ ¿©·¯ Ư¼ºÀ» Áö´Ï°í ÀÖ´Ù. ±×·¯³ª, °³³ä ±¸Á¶ÀÇ ±×·¡ÇÁ Ç¥ÇöÀº °³³ä ±×·¡ÇÁ¿¡ ´ëÇÑ ¿¬»êÀÇ º¹Àâµµ¸¦ Áõ°¡½ÃÅ°°í ÀÇ¹Ì Ç¥ÇöÀÇ ÀÏ°ü¼º(consistency)°ú À¯Àϼº(uniqueness)À» ÀÒ°Ô ÇÑ´Ù. º» ³í¹®¿¡¼´Â °³³ä ±×·¡ÇÁÀÇ ÀÌ·¯ÇÑ ¹®Á¦Á¡¿¡ ´ëÇØ ÀÚ¼¼È÷ »ìÆ캸°í À̸¦ ÇØ°áÇÑ °³³ä Æ®¸®ÀÇ Ç¥Çö ¹æ¹ýÀ» º¸ÀδÙ. Ç¥ÇöÀÇ À¯ÀϼºÀ» À§ÇØ, °³³ä Æ®¸®´Â Áß½É¾î ¼±Çà Ç¥Çö(preorder expression)¿¡ ÀÇÇØ Á¦¾àµÈ´Ù. ¶ÇÇÑ, Ç¥ÇöÀÇ ÀÏ°ü¼ºÀ» À§ÇØ ÁýÇÕ ÂüÁ¶´ë»ó(set referents)À» È®ÀåÇÏ°í À̸¦ ´Ù·ç±â À§ÇÑ set join ¿¬»êÀ» ÀçÁ¤ÀÇÇÑ´Ù. ¿ì¸®´Â °³³ä Æ®¸®°¡ ÀÚ¿¬¾î ¹®Àå¿¡ ´ëÇÑ Ç¥Çö·ÂÀ» À¯ÁöÇÏ¸é¼ È¿À²ÀûÀÓÀ» º¸ÀδÙ.
|
¿µ¹®³»¿ë (English Abstract) |
Conceptual graphs, which are a logic system and represent conceptual structures with graphs, have properties suitable for natural language processing. The graph representation of conceptual structures, however, increases the complexity of operations with conceptual graphs and loses the consistency and uniqueness of meaning representation. In this paper, we present these problems in detail and then we give representations in conceptual trees for resolving the problems. For the uniqueness, conceptual trees are restricted by preorder expression. For the consistency, we extend set referents and redefine the operation set join for manipulating them. We show that conceptual trees are efficient, keeping expressive power for natural language sentences.
|
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|