1. ThatÀÌ relative clause¸¦ ³ªÅ¸³»´ÂÁö ¾Ë¾Æº¸´Â Algorithm ±â¼úÇÏ°í,
tagger°¡ ¸î % error ÀÎÁö¸¦ ³ªÅ¸³¿.
¨ç ThatÀÌ Áö½ÃÇü¿ë»çÀÎÁö °ü°è ´ë¸í»çÀÎÁö ¾Ë¾Æ³»´Â Algorithm ±â¼ú.
- Áö½Ã Çü¿ë»ç¿Í °ü°è ´ë¸í»ç 2°¡Áö ¾²ÀÓ»õ·Î ¾²ÀÌ´Â °æ¿ì¸¸ °í·ÁÇÏ¿© ÇÑ´Ù¸é
* Áö½Ã Çü¿ë»ç(DT)ÀÎ °æ¿ì: thatÀÌ Çü¿ë»ç·Î ¾²¿´±â ¶§¹®¿¡ that + ¸í»ç°¡ ¿Ã °æ¿ì ¶Ç´Â
that + Çü¿ë»ç + ¸í»ç ´ëºÎºÐÀÇ °æ¿ì Áö½Ã Çü¿ë»ç°¡ µÊ.
* °ü°è ´ë¸í»ç(WDT)ÀÎ °æ¿ì: ÀÌÇÏ °ü°èÀýÀÇ ÁÖ¾î ¶Ç´Â ¸ñÀû¾î·Î¼ ¾Õ¿¡ ³ª¿À±â ¶§¹®¿¡
that + µ¿»ç (Á¶µ¿»ç Æ÷ÇÔ), ÀÎĪ ´ë¸í»ç°¡ ¿À´Â °æ¿ì¶ó ÇÒ¼ö°¡ ÀÖÀ½.
Algorithm 񃬣:
char str_buf[_MAXLEN]; //ÇÑ ´Ü¾î ÀúÀåÀ» À§ÇÑ ¹öÆÛ
While ( There is a phrase to parse){
read a word and store str_buf
if(str_buf == `that`) {
read a next word and store str_buf
search the dictionary and determine the part of speech
if(str_buf equals noun or adjp)
printf(` °á°ú´Â Áö½Ã Çü¿ë»çÀÇ That\\n);
else if(str_buf equals ¡¦(»ý·«)
¨è Àüü CorpusÀڷḦ APP¿¡¼ SimulationÇÑ °á°ú ºÐ¼®
2. That ¹®ÀÇ ³¡À» ¾Ë¾Æ³»´Â Algorithm ±â¼ú.
|