Language Learning from Good Examples
Abstract
We study learning of indexable families of recursive languages from good examples. We show that this approach is considerably more powerful than learning from all examples and point out reasons for this additional power. We present several characterizations of types of learning from good examples. We derive similarities as well as differences to learning of recursive functions from good examples.
Cite
Text
Lange et al. "Language Learning from Good Examples." International Conference on Algorithmic Learning Theory, 1994. doi:10.1007/3-540-58520-6_81Markdown
[Lange et al. "Language Learning from Good Examples." International Conference on Algorithmic Learning Theory, 1994.](https://mlanthology.org/alt/1994/lange1994alt-language/) doi:10.1007/3-540-58520-6_81BibTeX
@inproceedings{lange1994alt-language,
title = {{Language Learning from Good Examples}},
author = {Lange, Steffen and Nessel, Jochen and Wiehagen, Rolf},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1994},
pages = {423-437},
doi = {10.1007/3-540-58520-6_81},
url = {https://mlanthology.org/alt/1994/lange1994alt-language/}
}