Learning Efficiency of Very Simple Grammars from Positive Data

Yoshinaka, Ryo

doi:10.1007/978-3-540-75225-7_20

Learning Efficiency of Very Simple Grammars from Positive Data

Ryo Yoshinaka

ALT 2007 pp. 227-241

doi:10.1007/978-3-540-75225-7_20 /alt/2007/yoshinaka2007alt-learning/

Abstract

The class of very simple grammars is known to be polynomial-time identifiable in the limit from positive data. This paper gives even more general discussion on the efficiency of identification of very simple grammars from positive data, which includes both positive and negative results. In particular, we present an alternative efficient inconsistent learning algorithm for very simple grammars.

PDF ALT Semantic Scholar

Cite

Text

Yoshinaka. "Learning Efficiency of Very Simple Grammars from Positive Data." International Conference on Algorithmic Learning Theory, 2007. doi:10.1007/978-3-540-75225-7_20

Markdown

[Yoshinaka. "Learning Efficiency of Very Simple Grammars from Positive Data." International Conference on Algorithmic Learning Theory, 2007.](https://mlanthology.org/alt/2007/yoshinaka2007alt-learning/) doi:10.1007/978-3-540-75225-7_20

BibTeX

@inproceedings{yoshinaka2007alt-learning,
  title     = {{Learning Efficiency of Very Simple Grammars from Positive Data}},
  author    = {Yoshinaka, Ryo},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2007},
  pages     = {227-241},
  doi       = {10.1007/978-3-540-75225-7_20},
  url       = {https://mlanthology.org/alt/2007/yoshinaka2007alt-learning/}
}