Algorithm for developing Urdu Probabilistic Parser
Neelam Mukhtar, Mohammad Abid Khan, Fatima Tuz Zuhra · 2012
Any decision error in greedy search procedure results in a wrong parse. Best-first str ategy is complicated. The novel algorithm developed in this work is based on multi-path shift reduce-strategy. In this algorithm, if the input matches with more than one clause on the right hand side of a rule in Urdu probabilis tic context free grammar the items on the old stack are copied to a new processing stack and subsequently reduce operation is performed. A number of stacks can be created whenever required. The probabilities of the rules c an be added for each path. Parse tree with the highest probability is selected as the correct solution. Dr y run of the main algorithm shows the superiority of this al gorithm over its previous counter parts.