%0 Journal Article
%T Probabilistic Earley Algorithm Based on Extended Viterbi Path<br>基于扩展Viterbi路径的概率Earley算法
%A HAN Xi-wu
%A Roland Hausser
%A <br>韩习武
%A Roland Hausser
%J 计算机科学
%D 2011
%I 
%X Probabilistic Earlcy algorithm applies Viterbi path to construct parse trees for input sequences, but the grammar limits often result in many empty trees.This paper exploited optional start states, new sequential beginnings and more subtrees to extend the traditional Viterbi path, removed almost all empty trees, and improved the general parsing performance of Earley algorithm.
%K Viterbi path
%K Parsing
%K Probabilistic earley algorithm<br>Viterbi路径，句法分析，概率Earley算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=69B75E9607843D032A6D010B29575A45&yid=9377ED8094509821&vid=16D8618C6164A3ED&iid=CA4FD0336C81A37A&sid=334E2BB8B9A55ABB&eid=79D2EF35F60110C2&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=5