Probabilistic Earley Algorithm Based on Extended Viterbi Path
基于扩展Viterbi路径的概率Earley算法

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.