%0 Journal Article
%T Grammatical parsing algorithm based on expected categories<br>基于期待类型的Chart句法分析算法
%A WANG Yi
%A LI Zhong-zhi
%A <br>王牋
%A 李中志
%J 计算机应用
%D 2009
%I 
%X Chart algorithm is one of the most popular algorithms in grammatical parsing. Its computational efficiency, however, still needs to be improved. By analyzing two common used Chart algorithms, a new parsing algorithm was proposed based on the bottom-to-top Chart algorithm, combining with the predicating ability of the top-to-bottom Chart algorithm. The proposed algorithm executed exactly from left to right and bottom to top. At each word position in parsing, an expecting table was formed according to the active roles of existing active arcs and the grammatical rules, and was used to restrict the creating of arcs in the rest process of parsing. Experimental results show that the parsing speed improves about 24% compared with the standard Chart algorithm, meanwhile the number of the failed sentences reduces more than a half.
%K Chart<br>自然语言处理
%K 句法分析
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=CD0F6A7FFD75E03D346F40355B42C05D&yid=DE12191FBD62783C&vid=771469D9D58C34FF&iid=94C357A881DFC066&sid=10592E9CA5FCF96B&eid=9E9FFC2CDB44A291&journal_id=1001-9081&journal_name=计算机应用&referenced_num=1&reference_num=7