A Spectral Approach for Probabilistic Grammatical Inference on Trees

DOI10.1007/978-3-642-16108-7_10MaRDI QIDQ4930690zbMATH OpenOpenAlexFDO

Authors Raphaël Bailly, Amaury Habrard, François Denis

Publication date 1 October 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16108-7_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70)

Recommendations

• Using tree transducers for grammatical inference
• Stochastic inference of regular tree languages
• Inference of Finite-State Probabilistic Grammars
• scientific article; zbMATH DE number 2182434
• Grammatical Inference: Algorithms and Applications
• Publication:4890714
• scientific article; zbMATH DE number 512934
• scientific article; zbMATH DE number 2019601
• Learning of Structurally Unambiguous Probabilistic Grammars
• scientific article; zbMATH DE number 2090198

Cited in

(9)

• scientific article; zbMATH DE number 2019599 (Why is no real title available?)
• Learning Rational Stochastic Tree Languages
• scientific article; zbMATH DE number 1670725 (Why is no real title available?)
• Computing the relative entropy between regular tree languages
• Spectral learning of weighted automata. A forward-backward perspective
• Grammatical Inference: Algorithms and Applications
• Spectral learning of latent-variable PCFGs: algorithms and sample complexity
• Approximate minimization of weighted tree automata
• Recognizable series on graphs and hypergraphs

This page was built for publication: A Spectral Approach for Probabilistic Grammatical Inference on Trees

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