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

Simple item page
dc.contributor.authorStrydom L.R.
dc.contributor.authordu Preez J.A.
dc.date.accessioned2011-05-15T15:53:43Z
dc.date.available2011-05-15T15:53:43Z
dc.date.issued1996
dc.description.abstractAn 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).
dc.description.versionConference Paper
dc.identifier.citationIEEE AFRICON Conference
dc.identifier.citation1
dc.identifier.urihttp://hdl.handle.net/10019.1/8774
dc.titleDevelopment of an effective context-free parser for continuous stochastic languages
dc.typeConference Paper
Files
Collections
Stellenbosch University - Scopus Publications