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.
These algorithms are based on a generalisation of distributional learning; we prove correctness of our algorithm under an identification in the limit model.
Original language | English |
---|---|
Title of host publication | Proceedings of The 28th International Conference on Machine Learning |
Subtitle of host publication | ICML 2011 |
Editors | Lise Getoor, Tobias Scheffer |
Place of Publication | Madison |
Publisher | Madison : International Machine Learning Society |
Pages | 201-208 |
Number of pages | 8 |
ISBN (Print) | 9781450306195, 1450306195 |
Publication status | Published - 2011 |