Extending stochastic context-free grammars for an application in bioinformatics


FREE IEEE PAPERS

FREE-DOWNLOAD F Weinberg… – Language and Automata Theory and Applications, 2010 –
Abstract. We extend stochastic context-free grammars such that the probability of applying a
production can depend on the length of the subword that is generated from the application and
show that existing algorithms for training and determining the most probable parse tree 




IEEE PAPER UNITED STATES