Using tree transducers for grammatical inference

DOI10.1007/978-3-642-22221-4_16zbMATH Open1331.68237OpenAlexW87816958MaRDI QIDQ3010352FDOQ3010352

Authors: Noémie-Fleur Sandillon-Rezer, Richard Moot 

Publication date: 1 July 2011

Published in: Logical Aspects of Computational Linguistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22221-4_16

Recommendations

• Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples
• scientific article; zbMATH DE number 475423
• scientific article; zbMATH DE number 1670708
• Categorial Grammars and Tree Languages
• Logical Aspects of Computational Linguistics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Natural language processing (68T50) Linguistics (91F20)

Cited In (6)

• Recursive tree grammar autoencoders
• Learning Lambek grammars from proof frames
• Error-correcting tree language inference
• A Spectral Approach for Probabilistic Grammatical Inference on Trees
• Grammatical Inference: Algorithms and Applications
• Grammatical Inference: Algorithms and Applications

Uses Software

• CCGbank

This page was built for publication: Using tree transducers for grammatical inference

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