Spectral learning of latent-variable PCFGs: algorithms and sample complexity

MaRDI QIDQ2934082zbMATH OpenFDO

Authors Shay B. Cohen, Karl Stratos, Michael Collins, Dean P. Foster, Lyle H. Ungar

Publication date 8 December 2014

Full work available at URL http://jmlr.csail.mit.edu/papers/v15/cohen14a.html

zbMATH Keywords

latent-variable PCFGsspectral learning algorithms

Mathematics Subject Classification ID

Point estimation (62F10) Estimation in multivariate analysis (62H12) Natural language processing (68T50)

Recommendations

• Latent-variable PCFGs: background and applications
• A spectral algorithm for learning hidden Markov models
• Spectral methods for learning discrete latent tree models
• Spectral learning of weighted automata. A forward-backward perspective
• A Spectral Approach for Probabilistic Grammatical Inference on Trees

Cited in

(6)

• Spectral methods for learning discrete latent tree models
• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
• Latent-variable PCFGs: background and applications
• Spectral learning of weighted automata. A forward-backward perspective
• Learning grammars for architecture-specific facade parsing
• Approximate minimization of weighted tree automata

This page was built for publication: Spectral learning of latent-variable PCFGs: algorithms and sample complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934082)