Abstract Due to the lack of descriptive mechanism for syntactic functional structure, the dependency grammar can not express all complex syntactic structures explicitly. In addition, few parsing model takes the restrictive information of modifiers' nesting level into account, though it is a common sense in pragmatics. To solve these problems, a generative binary combinational grammar (BCG) parsing model is proposed which incorporates the restrictive information. In this model, the construction of sentence is regarded as the combination of adjacent chunks according to their headwords. Moreover, the symbolic local priorities between the adjacent binary relations and the modifiers' nesting levels are used to constrain the generation of parsing trees. The BCG parsing model is constructed by converting the dependency treebank to the BCG form. Then, the syntactic relations, the local priorities and the parameters of the model are induced automatically. Experimental results show that the proposed model improves the parsing accuracy.
[1] Gao Jianfeng, Nie Jianyun, Wu Guangyuan, et al. Dependence Language Model for Information Retrieval // Proc of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Sheffield, UK, 2004: 170-177 [2] Cai Keke, Bu Jiajun, Chen Chun, et al. A Novel Dependency Language Model for Information Retrieval. Journal of Zhejiang University: Science A, 2007, 8(6): 871-882 [3] Ding Fan, Wang Bin, Bai Shuo, et al. Effectiveness of Syntactic Relationship in Document Retrieval. Journal of Chinese Information Processing, 2008, 22(4): 66-74 (in Chinese) (丁 凡,王 斌,白 硕,等.文档检索中句法信息的有效利用研究.中文信息学报, 2008, 22(4): 66-74) [4] Nivre J, Hall J, Kübler S, et al. The CoNLL 2007 Shared Task on Dependency Parsing // Proc of the Conference on Empirical Methods in Natural Language Processing and Natural Language Learning. Prague, Czech Republic, 2007: 915-932 [5] Yang Xiao, Wan Jiancheng, Zhang Ling. Arithmetic Computing Based Chinese Automatic Parsing Method // Proc of the 8th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing. Qingdao, China, 2007, Ⅱ: 242-247 [6] Liu Ting, Ma Jinshan, Li Sheng. Chinese Dependency Parsing Model Based on Lexical Governing Degree. Journal of Software, 2006, 17(9): 1876-1883 (in Chinese) (刘 挺,马金山,李 生.基于词汇支配度的汉语依存分析模型.软件学报, 2006, 17(9): 1876-1883) [7] Gildea D, Temperley D. Optimizing Grammars for Minimum Dependency Length // Proc of the 45th Annual Meeting of the Association of Computational Linguistics. Prague, Czech Republic, 2007: 184-191 [8] Zhou Qiang, Huang Changning. An Improved Approach for Chinese Parsing Based on Local Preference Information. Journal of Software, 1999, 10(1): 1-6 (in Chinese) (周 强,黄昌宁.基于局部优先的汉语句法分析方法.软件学报, 1999, 10(1): 1-6) [9] Li Mu, Yao Tianshun. Towards a Rule Preference Based Approach to LSD Parsing. Journal of Computer Research and Development, 2001, 38(5): 597-603 (in Chinese) (李 沐,姚天顺.一种基于优先关系的LSD分析算法.计算机研究与发展, 2001, 38(5): 597-603) [10] Hopcroft J E, Ullman J D. Introduction to Automata Theory Languages, and Computation. Boston, USA: Addison-Wesley, 1979 [11] Sturt P, Costa F, Lombardo V, et al. Learning First-Pass Structural Attachment Preferences Using Dynamic Grammars and Recursive Neural Networks. Cognition, 2003, 88(2): 133-169 [12] Covington M A. A Dependency Parser for Variable Word Order Languages. Technical Report, AI-1990-01, Athens, USA: University of Georgia. Institute of Artificial Intelligence, 1990 [13] Dang Zhengfa, Zhou Qiang. Automatically Convert Treebank from Phase Structure to Dependency Structure. Journal of Chinese Information Processing, 2005, 19(3): 21-27 (in Chinese) (党政法,周 强.短语树到依存树的自动转换研究.中文信息学报, 2005, 19(3): 21-27) [14] Zhou Qiang. Phrase Bracketing and Annotating on Chinese Language Corpus. Ph. D Dissertation. Beijing, China: Peking University. Department of Computer Science and Technology, 2002 (in Chinese) (周 强.汉语语料库的短语自动划分和标注研究.博士学位论文.北京:北京大学.计算机科学与技术系, 2002) [15] Yang Xiao, Wan Jiancheng. A Paring Algorithm of Natural Language Based on Operator Precedence // Proc of the IEEE International Conference on Natural Language Processing and Knowledge Engineering. Wuhan, China, 2005: 73-78 [16] Liang P, Petrov S, Jordan M I, et al. The Infinite PCFG Using Hierarchical Dirichlet Processes // Proc of the Conference on Empirical Methods in Natural Language Processing and Natural Language Learning. Prague, Czech Republic, 2007: 688-697
2009, Vol. 22 
