Probabilistic k-testable tree languages

DOI10.1007/978-3-540-45257-7_18MaRDI QIDQ2754017zbMATH OpenFDO

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

Publication date 11 November 2001

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

Full work available at URL https://doi.org/10.1007/978-3-540-45257-7_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2019605
• Smoothing and compression with stochastic \(k\)-testable tree languages
• scientific article; zbMATH DE number 2090198
• A Spectral Approach for Probabilistic Grammatical Inference on Trees
• Stochastic inference of regular tree languages

Cited in

(9)

• Learning \((k,l)\)-contextual tree languages for information extraction from web pages
• Smoothing and compression with stochastic \(k\)-testable tree languages
• A general technique to train language models on language models
• Learning tree languages from text
• Learning Rational Stochastic Tree Languages
• Enhanced suffix arrays as language models: virtual k-testable languages
• scientific article; zbMATH DE number 2019605 (Why is no real title available?)
• scientific article; zbMATH DE number 1532350 (Why is no real title available?)
• scientific article; zbMATH DE number 2090198 (Why is no real title available?)

This page was built for publication: Probabilistic \(k\)-testable tree languages

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