PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data

Chihiro Shibata; Ryo Yoshinaka

doi:10.1007/978-3-642-40935-6_11

PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data

Chihiro Shibata, Ryo Yoshinaka

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Citations (Scopus)

Abstract

In recent years different interesting subclasses of cfls have been found to be learnable by techniques generically called distributional learning. The theoretical study on the exact learning of cfls by those techniques under different learning scheme is now quite mature. On the other hand, positive results on the pac learnability of cfls are rather limited and quite weak. This paper shows that several subclasses of context-free languages that are known to be exactly learnable with membership queries by distributional learning techniques are pac learnable from positive data under some assumptions on the string distribution.

Original language	English
Title of host publication	Algorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings
Pages	143-157
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-40935-6_11
Publication status	Published - 2013
Externally published	Yes
Event	24th International Conference on Algorithmic Learning Theory, ALT 2013 - Singapore, Singapore Duration: 2013 Oct 6 → 2013 Oct 9

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8139 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	24th International Conference on Algorithmic Learning Theory, ALT 2013
Country	Singapore
City	Singapore
Period	13/10/6 → 13/10/9

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-40935-6_11

Fingerprint Dive into the research topics of 'PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data'. Together they form a unique fingerprint.

Cite this

Shibata, C., & Yoshinaka, R. (2013). PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data. In Algorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings (pp. 143-157). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8139 LNAI). https://doi.org/10.1007/978-3-642-40935-6_11

PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data. / Shibata, Chihiro; Yoshinaka, Ryo.

Algorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings. 2013. p. 143-157 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8139 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Shibata, C & Yoshinaka, R 2013, PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data. in Algorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8139 LNAI, pp. 143-157, 24th International Conference on Algorithmic Learning Theory, ALT 2013, Singapore, Singapore, 13/10/6. https://doi.org/10.1007/978-3-642-40935-6_11

Shibata C, Yoshinaka R. PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data. In Algorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings. 2013. p. 143-157. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-40935-6_11

Shibata, Chihiro ; Yoshinaka, Ryo. / PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data. Algorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings. 2013. pp. 143-157 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b264afe98cb948c5ab5253663c605ad6,

title = "PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data",

abstract = "In recent years different interesting subclasses of cfls have been found to be learnable by techniques generically called distributional learning. The theoretical study on the exact learning of cfls by those techniques under different learning scheme is now quite mature. On the other hand, positive results on the pac learnability of cfls are rather limited and quite weak. This paper shows that several subclasses of context-free languages that are known to be exactly learnable with membership queries by distributional learning techniques are pac learnable from positive data under some assumptions on the string distribution.",

author = "Chihiro Shibata and Ryo Yoshinaka",

year = "2013",

doi = "10.1007/978-3-642-40935-6_11",

language = "English",

isbn = "9783642409349",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "143--157",

booktitle = "Algorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings",

}

TY - GEN

T1 - PAC learning of some subclasses of context-free grammars with basic distributional properties from positive data

AU - Shibata, Chihiro

AU - Yoshinaka, Ryo

PY - 2013

Y1 - 2013

N2 - In recent years different interesting subclasses of cfls have been found to be learnable by techniques generically called distributional learning. The theoretical study on the exact learning of cfls by those techniques under different learning scheme is now quite mature. On the other hand, positive results on the pac learnability of cfls are rather limited and quite weak. This paper shows that several subclasses of context-free languages that are known to be exactly learnable with membership queries by distributional learning techniques are pac learnable from positive data under some assumptions on the string distribution.

AB - In recent years different interesting subclasses of cfls have been found to be learnable by techniques generically called distributional learning. The theoretical study on the exact learning of cfls by those techniques under different learning scheme is now quite mature. On the other hand, positive results on the pac learnability of cfls are rather limited and quite weak. This paper shows that several subclasses of context-free languages that are known to be exactly learnable with membership queries by distributional learning techniques are pac learnable from positive data under some assumptions on the string distribution.

UR - http://www.scopus.com/inward/record.url?scp=84887469709&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84887469709&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-40935-6_11

DO - 10.1007/978-3-642-40935-6_11

M3 - Conference contribution

AN - SCOPUS:84887469709

SN - 9783642409349

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 143

EP - 157

BT - Algorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings

T2 - 24th International Conference on Algorithmic Learning Theory, ALT 2013

Y2 - 6 October 2013 through 9 October 2013

ER -