资源分类
》 资源 》论文》Inference of Inversion Transduction Grammars

Inference of Inversion Transduction Grammars

2020-02-27 | |  53 |   53 |   0

Abstract

We present the first polynomial algorithm for learning a class of inversion transduction grammars (itgs) that implement context free transducers – functions from strings to strings. The class of transductions that we can learn properly includes all subsequential transductions. These algorithms are based on a generalisation of distributional learning; we prove correctness of our algorithm under an identification in the limit model.

上一篇：Generating Text with Recurrent Neural Networks

下一篇：Learning Attentional Policies for Tracking and Recognition in Video with Deep Networks

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...