Earley Parsers with Contributive Paths
Xiwu Han · INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences · 2011
This paper proposed two contributive paths based on the probabilistic Earley algorithm. We argue that these paths contribute better to the grammaticality of the input sentence than the Viterbi path, and hence are more capable of parsing structurally ambiguous sequences. An exponentially weighted combination of the parsing results from the contributive and the Viterbi paths achieved promising performances on the parsing task of CIPS ParsEval-2009. Besides, our experiment results on a set of 1200 ambiguous Chinese sentences also showed that the Earley parser with contributive paths outperformed both the Viterbi Earley and the Berkley parser significantly.