scientific article; zbMATH DE number 2019605

MaRDI QIDQ4440398zbMATH OpenFDO

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

Publication date 17 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2484/24840199.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 1670725
• Smoothing and compression with stochastic \(k\)-testable tree languages
• scientific article; zbMATH DE number 2090198
• Learning Rational Stochastic Tree Languages
• Computing the relative entropy between regular tree languages

Cited in

(11)

• Stochastically costed tree automata: Turakainen's theorem
• LARS: a learning algorithm for rewriting systems
• Smoothing and compression with stochastic \(k\)-testable tree languages
• scientific article; zbMATH DE number 1670725 (Why is no real title available?)
• Computing the relative entropy between regular tree languages
• Learning tree languages from text
• Relevant Representations for the Inference of Rational Stochastic Tree Languages
• Enhanced suffix arrays as language models: virtual k-testable languages
• scientific article; zbMATH DE number 1099038 (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:

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