14 search results - page 1 / 3 » Computation of Substring Probabilities in Stochastic Grammar... |
ICGI
2000
Springer
13 years 9 months ago
2000
Springer
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 prob...
ACL
1994
13 years 7 months ago
1994
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
ACL
2012
11 years 8 months ago
2012
In this paper, we demonstrate that accurate machine translation is possible without the concept of “words,” treating MT as a problem of transformation between character string...
COLING
1996
13 years 7 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
ACCV
2006
Springer
13 years 9 months ago
2006
Springer
Stochastic grammar has been used in many video analysis and event recognition applications as an efficient model to represent large-scale video activity. However, in previous works...