세종 구문분석 말뭉치를 기반으로 한 확률 문맥자유문법 규칙Probabilistic Context-Free Grammar Rules based on Sejong Korean Treebank
- Other Titles
- Probabilistic Context-Free Grammar Rules based on Sejong Korean Treebank
- Authors
- 최재웅; 송상헌; 전지은
- Issue Date
- 2008
- Publisher
- 고려대학교 언어정보연구소
- Keywords
- Sejong Korean Treebank; probabilistic context-free grammar rules; corpus; frequency; parsed nodes; trees
- Citation
- 언어정보, no.9, pp.87 - 139
- Journal Title
- 언어정보
- Number
- 9
- Start Page
- 87
- End Page
- 139
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/125070
- ISSN
- 1226-8011
- Abstract
- The Sejong Korean Treebank (SKT) was built as part of 10 year government-sponsored Sejong project, and more than 80 million graphic-word Korean parsed corpus has been released to the public at the end of 2007. The purpose of this paper is to extract Context-Free Grammar (CFG) rules from SKT and to draw some linguistic generalizations based on the CFG rules. We introduce an extraction algorithm that was used in this study and prove that it meets the minimal requirements as an objective extraction method in terms of its precision and recall rates. Then our discussion of the extracted CFG rules proceed in terms of the minimal tree structure containing a mother node (MN) and its two daughter nodes (Left DN, Right DN). We arrive at various linguistic or stochastic generalizations restricting the distribution of the categories in the minimal tree structure for Korean, for example, one that states 'In more than 95% of the cases that involve S, VP, NP, VNP, and AP, MN and RDN share the same category.' We provide most of the detailed statistical information regarding the basic properties of SKT and the CFG rules derived from it.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Liberal Arts > Department of Linguistics > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholar.korea.ac.kr/handle/2021.sw.korea/125070)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.