This paper presents an effective framework for Chinesesyntactic parsing, which includes two parts. The first one is a parsing framework, which is based on an improved bottom-up chart parsingalgorithm, and integrates the idea of the beam search strategy of N bestalgorithm and heuristic function of A* algorithm for pruning, then get multiple parsing trees. The second is a novel evaluation model, which integrates contextual and partial lexical information into traditional PCFG model and defines a new score function. Using this model, the tree with the highest score is found out as the best parsing tree. Finally,the contrasting experiment results are given. Keywords?syntactic parsing, PCFG, pruning, evaluation model.
 Y. Tsuruoka, Y. Miyao and Jun?ichi Tsujii, ?Towards efficient probabilistic HPSG parsing: integrating semantic and syntactic preference to guide the parsing?. Proceedings of IJCNLP-04 (Companion Volume),2004, pp. 37-40.
 Dan Klein and C. D. Manning, "A* Parsing: Fast Exact Viterbi ParseSelection", Proceedings of HLT-NAACL'03, 2003, pp. 119-126.
 Brian Roark, ?Probabilistic top-down parsing and language modeling?,Computational Linguistics, 27(2):249?276, 2001.
 Adwait Ratnaparkhi, ?Learning to parse natural language with maximumentropy models?. Machine Learning, 34:151?175, 1999.
 S. Bai, H. Zhang, ?A role inverse algorithm?. Journal of Software,14(3):328~333, 2003.
 Stuart Russell, P. Norvig, ?Artificial Intelligence: a Modern Approach?, Prentice-Hall, pp. 696~703, 1995.
 Susan L. Graham, M. Harrison, W.L. Ruzzo, ?An improved context-freerecognizer?, ACM Transactions on Programming Languages and Systems,2(3): 415~462, 1980.
 D Zhu , ?explore ??? ?,Chinese Language and Writing, 1961
 E.Charniak, ?context-free grammar and word statistics?. In Proc of AAAI?97, 1997. World Academy of Science, Engineering and Technology 2 2007700