Weakly Restricted Stochastic Grammars

نویسندگان

  • Rieks op den Akker
  • Hugo ter Doest
چکیده

A new type of stochastic grammars is introduced for investigation: weakly restricted stochastic grammars. In this paper we will concentrate on the consistency problem. To nd conditions for stochastic grammars to be consistent, the theory of multitype Galton-Watson branching processes and generating functions is of central importance. The unrestricted stochastic grammar formalism generates the same class of languages as the weakly restricted formalism. The inside-outside algorithm is adapted for use with weakly restricted grammars.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Languages and Stochastic Grammars

Two types of stochastic grammars are introduced for investigation: the (classical) unrestricted stoch-astic grammars and the (newly introduced) weakly restricted stochastic grammars. Especially consistency and conditions for it will be treated. The theory of multitype Galton-Watson branching processes and generating functions is of central importance to nd criteria for consistency. We will prov...

متن کامل

Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars

We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, beta-sheet regions in particular, using a class of stochastic tree grammars as representational language for their amino acid sequence patterns. The family of stochastic tree grammars we use, the Stochastic Ranked Node Rewriting Grammars (SRNRG), is one of the rare families of stochastic gramma...

متن کامل

Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search

We have previously used grammars as a formalism to structure a GA's search for program called sorting networks (SNets) [KBW95]. In this paper we restrict ourselves to stochastic context-free grammars which, while more analytically tracxtable than our SNet grammars, are more difficult than others previously considered by the GA community. In our approach: production rules of a grammar are encode...

متن کامل

Numerical Solution of Weakly Singular Ito-Volterra Integral Equations via Operational Matrix Method based on Euler Polynomials

Introduction Many problems which appear in different sciences such as physics, engineering, biology, applied mathematics and different branches can be modeled by using deterministic integral equations. Weakly singular integral equation is one of the principle type of integral equations which was introduced by Abel for the first time. These problems are often dependent on a noise source which a...

متن کامل

Estimation of the probability distributions of stochastic context-free grammars from the k-best derivations

The use of the Inside-Outside (IO) algorithm for the estimation of the probability distributions of Stochastic Context-Free Grammars (SCFGs) in Natural-Language processing is restricted due to the time complexity per iteration and the large number of iterations that it needs to converge. Alternatively, an algorithm based on the Viterbi score (VS) is used. This VS algorithm converges more rapidl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994