Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ICGI
2000
Springer

favoriteEmaildiscussreport

103views Natural Language Processing» more ICGI 2000»

Computation of Substring Probabilities in Stochastic Grammars

13 years 8 months ago

Computation of Substring Probabilities in Stochastic Grammars

Download www.lx.it.pt

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.

Ana L. N. Fred

Real-time Traffic

ICGI 2000 | Natural Language Processing | Pattern Recognition Problems | Prediction And/or Recognition | Stochastic Regular Languages |

claim paper

Related Content

» Precise NGram Probabilities from Stochastic ContextFree Grammars

» Machine Translation without Words through Substring Alignment

» Computational Complexity of Probabilistic Disambiguation by means of TreeGrammars

» Complex Activity Representation and Recognition by Extended Stochastic Grammar

» A Stochastic Language Model using Dependency and Its Improvement by Word Clustering

» Probabilistic regular graphs

» Effective Bayesian Inference for Stochastic Programs

» Evolutionary Parsing for a Probabilistic Context Free Grammar

» Equilibria Fixed Points and Complexity Classes

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	ICGI
Authors	Ana L. N. Fred

Comments (0)