A Fast and Robust Parser Based on The Viterbi Algorithm

In this paper, with the goal of using Viterbi algorithm as a quick Top-down parsing procedure, a new probabilistic model called Rule Bi-gram is introduced. By extending rule bi-gram model, we have implemented a new parsing algorithm (VPA) based on the Viterbi algorithm. Our experiments show that although in applications in which an exact parse of the input sentence is required, this method may not be appropriate, in applications where speed is a crucial criterion (such as real-time speech recognition), the new algorithm performs very efficient and robust*.

Keywords:

Natural Language Processing , Parsing , Viterbi Algorithm , Speech Recognition