Development of an effective context-free parser for continuous stochastic languages

Strydom L.R. ; du Preez J.A. (1996)

Conference Paper

An effective parser is developed to parse input strings according to a continuous stochastic context-free grammar. This new parser finds the most probable parse tree, so that it is the context-free analog of the Viterbi algorithm. A pruning technique is also implemented to reduce the time complexity to O(n2).

Please refer to this item in SUNScholar by using the following persistent URL:
This item appears in the following collections: