Abstract
The time complexity of finding the most probable derivation for stochastic context-free grammars is cubic in the size of the input. The Viterbi algorithm solves the same task in linear time for stochastic regular languages. We present two modified versions of this algorithm. One finds the most probable path and builds a parse tree for stochastic one-counter languages in quadratic time of the size of the input. The other finds the most probable derivation for stochastic linear languages, also in quadratic time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
