Learning sequential tree-to-word transducers

DOI10.1007/978-3-319-04921-2_40MaRDI QIDQ5404938zbMATH OpenOpenAlexWikidataFDO

Authors Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Sławomir Staworko, M. Tommasi

Publication date 31 March 2014

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/19314071/Lawrence_Lemay_ET_AL_2014_Learning_Sequential_Tree_to_Word_Transducers.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Recommendations

• Normalization of sequential top-down tree-to-word transducers
• Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples
• scientific article; zbMATH DE number 1670727
• A canonical semi-deterministic transducer
• Learning Rational Stochastic Tree Languages

Cited in

(13)

• When errors become the rule: twenty years with transformation-based learning
• Recursive tree grammar autoencoders
• Normalization of sequential top-down tree-to-word transducers
• Individual Sequence Prediction Using Memory-Efficient Context Trees
• Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples
• Set-to-Sequence Methods in Machine Learning: A Review
• scientific article; zbMATH DE number 1670727 (Why is no real title available?)
• scientific article; zbMATH DE number 7228439 (Why is no real title available?)
• Equivalence of Linear Tree Transducers with Output in the Free Group
• Learning local transductions is hard
• Grammatical Inference: Algorithms and Applications
• Unsupervised sub-tree alignment for tree-to-tree translation
• A canonical semi-deterministic transducer

This page was built for publication: Learning sequential tree-to-word transducers

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