Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
ÇѱÛÁ¦¸ñ(Korean Title) |
ÀÚ¿¬¾î ÀÎÅÍÆäÀ̽º¸¦ À§ÇÑ °ü°è¿¡ ´ëÇÑ ÀÚ¿¬¾î Ç¥Çö ÀÚµ¿ ¼öÁý ¹æ¹ý |
¿µ¹®Á¦¸ñ(English Title) |
Automatic Collection of Natural Language Expressions of Relations for Natural Language Interface |
ÀúÀÚ(Author) |
ÇÑ¿ëÁø
¹Ú¼¼¿µ
¹Ú¼º¹è
Yong-Jin Han
Se Young Park
Seong-Bae Park
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 38 NO. 10 PP. 0536 ~ 0542 (2011. 10) |
Çѱ۳»¿ë (Korean Abstract) |
°ü°è¿¡ ´ëÇÑ ´Ù¾çÇÑ ÀÚ¿¬¾î Ç¥ÇöÀ» ´Ù·ç´Â °ÍÀº ±¸Á¶ Á¤º¸¿¡ ´ëÇÑ ÀÚ¿¬¾î ÁúÀÇ ÀÎÅÍÆäÀ̽º ¿¬±¸ÀÇ Áß¿äÇÑ ¹®Á¦ Áß ÇϳªÀÌ´Ù. ÀÌ·¯ÇÑ ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇÑ ±âÁ¸ÀÇ ¿¬±¸µéÀº ÀÚ¿¬¾î ÁúÀÇ ÀÎÅÍÆäÀ̽º¸¦ ´ë»ó ºÐ¾ß¿¡ ÀûÇÕÇÏ°Ô ±¸ÃàÇϱâ À§ÇÑ ¼öÀÛ¾÷¿¡ ÀÇÁ¸ÇÏ¿´´Ù. ÀÌ·¯ÇÑ Á¢±ÙÀº ¼Ò±Ô¸ð ±¸Á¶ Á¤º¸¿¡ ´ëÇÑ ÀÚ¿¬¾î ÁúÀÇ ÀÎÅÍÆäÀ̽º ±¸Ãà ½Ã È¿À²ÀûÀ¸·Î Àû¿ëµÉ ¼ö ÀÖ´Ù. ÇÏÁö¸¸ ÃÖ±Ù¿¡´Â RDF¿Í OWL°ú °°Àº ±×·¡ÇÁ ±¸Á¶ Á¤º¸°¡ ´Ù¾çÇÑ ºÐ¾ß¿¡¼ ´ë·®À¸·Î »ý¼ºµÇ°í ÀÖ´Ù. ¼öÀÛ¾÷¿¡ ÀÇÁ¸ÇÏ´Â Á¢±ÙÀ» ÅëÇØ ÀÌ·¯ÇÑ ´ë·®ÀÇ ±×·¡ÇÁ ±¸Á¶ Á¤º¸¿¡ ´ëÇÑ ÀÚ¿¬¾î ÀÎÅÍÆäÀ̽º¸¦ ±¸ÃàÇϱ⿡´Â ¾î·Á¿òÀÌ ÀÖ´Ù. º» ³í¹®Àº ÀÚ¿¬¾î ÀÎÅÍÆäÀ̽º¿¡ ´ëÇÑ ÀÚ¿¬¾î Ç¥ÇöÀÇ ´Ù¾ç¼º ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇØ ÀÚµ¿À¸·Î °ü°è¿¡ ´ëÇÑ ÀÚ¿¬¾î Ç¥ÇöÀ» ¼öÁýÇÏ´Â Àå¹ýÀ» Á¦¾ÈÇÑ´Ù. ±×·¡ÇÁ ±¸Á¶ Á¤º¸¿¡¼ °ü°è´Â µÎ °´Ã¼¸¦ ¿¬°áÇÏ´Â À¯ÀÏÇÑ ¿¡Áö(edge)·Î Ç¥ÇöµÈ´Ù. Á¦¾ÈÇÑ ¹æ¹ýÀº ÁÖ¾îÁø ¿¡Áö·Î ¿¬°áµÇ´Â ¼·Î ´Ù¸¥ °´Ã¼ ½ÖÀ» ¸»¹¶Ä¡(corpus)¿¡¼ °Ë»öÇÏ°í °Ë»öµÈ °´Ã¼ ½Ö ÁÖº¯¿¡¼ ºó¹øÇÏ°Ô µîÀåÇÏ´Â ÀÚ¿¬¾î Ç¥ÇöÀ» ¼öÁýÇÑ´Ù. ÀÚµ¿À¸·Î ¼öÁýÇÑ ÀÚ¿¬¾î ÁúÀÇ Ç¥ÇöÀ» ÀÚ¿¬¾î ÀÎÅÍÆäÀ̽º¿¡ Àû¿ëÇÑ °á°ú ¼öÀÛ¾÷¿¡ ÀÇÁ¸ÇÏ´Â ±âÁ¸ ¿¬±¸µé°ú ºñ±³ÇÒ ¸¸ÇÑ ½ÇÇè °á°ú¸¦ º¸¿´´Ù. |
¿µ¹®³»¿ë (English Abstract) |
One of the critical problems in natural language interfaces (NLI) to structured data is to handle the large variability in the way that a relation can be expressed. Existing approaches to solve this problem rely on manual process to adapt NLI to a new domain. The manual approaches can be efficiently applied to small structured data. However, nowadays, large volumes of graph-structured data such as RDF and OWL have been produced from a variety of areas on the web. It is not easy to adapt NLI to such large graph structured data. As a solution of the variability problem in NLI, this paper proposes an automatic method to identify relations in natural language queries for NLI to graph structured data. A relation between two entities is uniquely defined as an edge linking the entities on graph-structured data. The proposed method automatically discovers natural language expressions for given relations by querying entity pairs linked with the relations from a corpus. A relation corresponding to an edge is modeled as a collection of frequently appeared expressions. In the experiment, automatically collected expressions are applied to a NLI and the NLI showed comparable results with manually approaches. |
Å°¿öµå(Keyword) |
ÀÚ¿¬¾î ÀÎÅÍÆäÀ̽º
°ü°è
ÀÚ¿¬¾î Ç¥Çö ¼öÁý
±×·¡ÇÁ ±¸Á¶ Á¤º¸
Natural language interface
relation
automaticcollection of natural languageexpressions
graph structure information
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|