Smoothing and compression with stochastic k-testable tree languages

DOI10.1016/J.PATCOG.2004.03.024MaRDI QIDQ2485083zbMATH OpenOpenAlexFDO

Authors Juan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco

Publication date 3 August 2005

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10045/14022

zbMATH Keywords

Stochastic modelsData compressionSmoothingBacking-offTree grammars

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 2019605
• scientific article; zbMATH DE number 1670725
• Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code
• Syntax directed compression of trees using pushdown automata
• Learning Rational Stochastic Tree Languages

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 1117901 (Why is no real title available?)
• scientific article; zbMATH DE number 2019605 (Why is no real title available?)
• scientific article; zbMATH DE number 2090198 (Why is no real title available?)
• scientific article; zbMATH DE number 3236503 (Why is no real title available?)
• Disambiguating grammars by exclusion of sub-parse trees
• Efficient learning of context-free grammars from positive structural examples
• Language identification in the limit
• Locally testable languages
• Minimal Ascending and Descending Tree Automata
• On polynomial-time learnability in the limit of strictly deterministic automata
• Solution of an Open Problem on Probabilistic Grammars
• Stochastic inference of regular tree languages

Cited in

(6)

• scientific article; zbMATH DE number 1670725 (Why is no real title available?)
• Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code
• Enhanced suffix arrays as language models: virtual \(k\)-testable languages
• scientific article; zbMATH DE number 1931834 (Why is no real title available?)
• scientific article; zbMATH DE number 2019605 (Why is no real title available?)
• Grammatical inference of directed acyclic graph languages with polynomial time complexity

Describes a project that uses

Uses Software

• Penn Treebank

This page was built for publication: Smoothing and compression with stochastic \(k\)-testable tree languages

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