Computation of Substring Probabilities in Stochastic Grammars

Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition problems concerning the prediction and/or recognition based on partial observations. This paper presents algorithms for the computation of substring probabilities in stochastic regular languages. Situations covered include pre x, su x and island probabilities. The computational time complexity of the algorithms is analyzed.

• Type: Conference
• Year: 2000
• Where: ICGI
• Authors: Ana L. N. Fred
• Keywords: ICGI 2000, Natural Language Processing, Pattern Recognition Problems, Prediction And/or Recognition, Stochastic Regular Languages