Learning of Structurally Unambiguous Probabilistic Grammars

11/15/2020
by   Dolav Nitay, et al.
0

The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness results for learning context-free grammars in general, and probabilistic grammars in particular, most of the literature has concentrated on the second problem. In this work we address the first problem. We restrict attention to structurally unambiguous weighted context-free grammars (SUWCFG) and provide a query learning algorithm for structurally unambiguous probabilistic context-free grammars (SUPCFG). We show that SUWCFG can be represented using co-linear multiplicity tree automata (CMTA), and provide a polynomial learning algorithm that learns CMTAs. We show that the learned CMTA can be converted into a probabilistic grammar, thus providing a complete algorithm for learning a structurally unambiguous probabilistic context free grammar (both the grammar topology and the probabilistic weights) using structured membership queries and structured equivalence queries. We demonstrate the usefulness of our algorithm in learning PCFGs over genomic data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2022

P(Expression|Grammar): Probability of deriving an algebraic expression with a probabilistic context-free grammar

Probabilistic context-free grammars have a long-term record of use as ge...
research
06/26/2022

Marginal Inference queries in Hidden Markov Models under context-free grammar constraints

The primary use of any probabilistic model involving a set of random var...
research
01/27/2020

Unsupervised Program Synthesis for Images using Tree-Structured LSTM

Program synthesis has recently emerged as a promising approach to the im...
research
10/16/2012

Exploiting compositionality to explore a large space of model structures

The recent proliferation of richly structured probabilistic models raise...
research
12/13/2014

Multi-Context Models for Reasoning under Partial Knowledge: Generative Process and Inference Grammar

Arriving at the complete probabilistic knowledge of a domain, i.e., lear...
research
02/11/2019

Edge Replacement Grammars: A Formal Language Approach for Generating Graphs

Graphs are increasingly becoming ubiquitous as models for structured dat...
research
08/30/2021

Learning Highly Recursive Input Grammars

This paper presents Arvada, an algorithm for learning context-free gramm...

Please sign up or login with your details

Forgot password? Click here to reset