- Learning Tree Adjoining Grammars from structures and strings
- JMLR Workshop and Conference Proceedings
- Pages (from-to)
- Document type
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
We investigate the learnability of certain subclasses of tree adjoining grammars (TAGs). TAGs are based on two tree-tree operations, and generate structures known as derived trees. The corresponding strings form a mildly context-sensitive language. We prove that even very constrained subclasses of TAGs are not learnable from structures (derived trees) or strings, demonstrating that this type of problem is far from trivial. We also demonstrate that a large (parameterized) family of classes of TAGs is learnable from strings.
- Proceedings title: ICGI 2012: proceedings of the Eleventh International Conference on Grammatical Inference: September 5-8,
2012, University of Maryland, College Park, United States
Place of publication: [S.l.]
Editors: J. Heinz, C. de la Higuera, T. Oates
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.