Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1

DOI10.1007/11872436_19MaRDI QIDQ3541866zbMATH OpenOpenAlexFDO

Authors Alexander Clark

Publication date 27 November 2008

Published in Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11872436_19

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Predicate transformers for extended probability and non-determinism
• Iterating transducers in the large (extended abstract)
• Probabilistic inference by program transformation in Hakaru (system description)
• scientific article; zbMATH DE number 1670709
• ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION
• Stochastic inference of regular tree languages
• On efficient recognition of transductions and relations
• Inference of finite-state transducers from regular languages
• A unified framework for disambiguating finite transductions

Cited in

(1)

• The Tenjinno Machine Translation Competition

This page was built for publication: Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1

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