Discriminative Learning for Probabilistic Context-Free Grammars based on Generalized H-Criterion

2021/03/15 by Mauricio Maca, Maca, Mauricio, José-Miguel Benedí +4
Computer Science · #Natural Language Processing Techniques #Speech and dialogue systems #Topic Modeling #cs.CL #cs.LG

paper · pdf · doi:10.48550/arxiv.2103.08656

arxiv created 2021/03/15 · arxiv updated 2021/03/17

Abstract

We present a formal framework for the development of a family of discriminative learning algorithms for Probabilistic Context-Free Grammars (PCFGs) based on a generalization of criterion-H. First of all, we propose the H-criterion as the objective function and the Growth Transformations as the optimization method, which allows us to develop the final expressions for the estimation of the parameters of the PCFGs. And second, we generalize the H-criterion to take into account the set of reference interpretations and the set of competing interpretations, and we propose a new family of objective functions that allow us to develop the expressions of the estimation transformations for PCFGs.

Related

• Learning of Structurally Unambiguous Probabilistic Grammars
• A Tutorial on the Expectation-Maximization Algorithm Including Maximum-Likelihood Estimation and EM Training of Probabilistic Context-Free Grammars
• On the Computation of Distances for Probabilistic Context-Free Grammars
• Compound Probabilistic Context-Free Grammars for Grammar Induction
• Marginal Inference queries in Hidden Markov Models under context-free grammar constraints